{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"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":"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":"polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions (cyclomatic 424): polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions has cyclomatic complexity 424 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c583c6833b68118e22fc83293b65281281d7cf25cac76fbe84fc8aac574b5ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_python::lazyframe::visitor::expr_nodes::into_py (cyclomatic 421): polars_python::lazyframe::visitor::expr_nodes::into_py has cyclomatic complexity 421 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"114ad62e087390b00e5e8835ee4a83e255ad5920aaa34cad5e37d4503ecde80d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl (cyclomatic 369): polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl has cyclomatic complexity 369 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e336a0edaf468f47ab41b0119e6b4c6c4d635fc8f0b1e1ef220323a12f004"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::cast::cast (cyclomatic 317): polars_compute::cast::cast has cyclomatic complexity 317 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bfd912ff503fb76e202c57661f76b96847887eccd4fd2055ede457fb392ea1"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectionPushdownVisitor::pushdown (cyclomatic 266): ProjectionPushdownVisitor::pushdown has cyclomatic complexity 266 (threshold 15). Of this number, 261 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2f4e7b5a0cf4042bd9cbe5c528e3d71c80ef9f8c1d49293d5dbfe35ae9b27d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLFunctionVisitor::visit_function (cyclomatic 236): SQLFunctionVisitor::visit_function has cyclomatic complexity 236 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3af7457d488c2568becae4f8e9abbac773dc00e0396df1e55c6c2ce1fa70048"}},{"ruleId":"D1","level":"warning","message":{"text":"IRFunctionExpr::get_field (cyclomatic 197): IRFunctionExpr::get_field has cyclomatic complexity 197 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"800dee052f8a84e75ea148a9ad4ce445329bb7fc0324bb51ca0b04b2949e37b6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::utils::supertype::get_supertype_with_options::inner (cyclomatic 179): polars_core::utils::supertype::get_supertype_with_options::inner has cyclomatic complexity 179 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1ace4c3b2ad2f69acefdce0aee6618344339564921318e2649adfcfa472ca4"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::lower_ir::lower_ir_inner (cyclomatic 156): polars_stream::physical_plan::lower_ir::lower_ir_inner has cyclomatic complexity 156 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4bb5de20895cdffc1de0aa705883fca1e04fc9e9aa6d1c9224f3089042cde3"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_expr::dispatch::function_expr_to_udf (cyclomatic 144): polars_expr::dispatch::function_expr_to_udf has cyclomatic complexity 144 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6024445e34e4536ef471cb5e856bbfc63afd360fc7d151c5836608ecec55a275"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::to_alp_impl (cyclomatic 139): polars_plan::plans::conversion::dsl_to_ir::to_alp_impl has cyclomatic complexity 139 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54a94fecbb74af186d68a7f14d5b4f0da8ca514e7b3ef42e70cf56cf57ca4f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionExpr::fmt (cyclomatic 129): FunctionExpr::fmt has cyclomatic complexity 129 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30a80b866e132ef574ca1808f0ff3d85d492349a8f988da392e9b30909d43a3"}},{"ruleId":"D1","level":"warning","message":{"text":"IRFunctionExpr::fmt_name (cyclomatic 128): IRFunctionExpr::fmt_name has cyclomatic complexity 128 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8d24e055a137a2872bee168480d1e2cf38eddc878497e4d1a01993812613dd"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::fmt::visualize_plan_rec (cyclomatic 127): polars_stream::physical_plan::fmt::visualize_plan_rec has cyclomatic complexity 127 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d12084081349caaef9481e2e91bb41679677934d30ae2bf361dc547dc4f70fc"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCoercionRule::optimize_expr (cyclomatic 124): TypeCoercionRule::optimize_expr has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba16b66d6ae05d14039586ed8764e093b655b3d914b2ef504caaf7f05e4f6ab"}},{"ruleId":"D1","level":"warning","message":{"text":"SimplifyIRNodeOrder::simplify_ir_node_orders (cyclomatic 118): SimplifyIRNodeOrder::simplify_ir_node_orders has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ce340eca7589e26d9f66b5c196df4f4864220d2cf88454f2efbde3241a0b19"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx (cyclomatic 115): polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx has cyclomatic complexity 115 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8faa7e71703ea1e3cf2e381a344233db4276b7f038a1cea857255669209df12"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::to_graph::to_graph_rec (cyclomatic 113): polars_stream::physical_plan::to_graph::to_graph_rec has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"96028bdd914f5aca2d3e72faf36316c738ad4f667e24c9478497d4aeef099689"}},{"ruleId":"D1","level":"warning","message":{"text":"IRFunctionExpr::function_options (cyclomatic 112): IRFunctionExpr::function_options has cyclomatic complexity 112 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f032058bda9e467e4fde20fdf109728653f8e7a52938666e8471db11e423808"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergScanResolver._to_dataset_scan_impl (cyclomatic 88): IcebergScanResolver._to_dataset_scan_impl has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fcddbc538a25eecc3a27834882ee557275a86974f698d4e1a10715322cdaac"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprOrderSimplifier::rec (cyclomatic 87): ExprOrderSimplifier::rec has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d30f702f798051eeb0d92cf417e6626928ed24f786575e79484dba37cc31181"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowExpr::evaluate_on_groups_impl (cyclomatic 83): WindowExpr::evaluate_on_groups_impl has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9183d3c27068ae5a00ebd66a3d68692d7a20a2359fe6980814b6fe2cde8f88"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::to_description::phys_props (cyclomatic 81): polars_stream::physical_plan::to_description::phys_props 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":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5318849ee7f03aeb9a8c9f9419944c14240e849452b6025df43aea5569127546"}},{"ruleId":"D1","level":"warning","message":{"text":"SlicePushDown::pushdown (cyclomatic 80): SlicePushDown::pushdown has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8a1ce0255171d6c5b98141e36d790db7be3ff40ef08db1f44fa1bfab3ac157"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec (cyclomatic 80): polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d3128a711d3a761e8295b143c70983eb14252cd9ec31fea69c341897418531"}},{"ruleId":"D1","level":"warning","message":{"text":"SimplifyExprRule::optimize_expr (cyclomatic 79): SimplifyExprRule::optimize_expr has cyclomatic complexity 79 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb11b58345920f5e54a0b443788fdffa38a75889e4865bee1124e515a1d3be7"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type (cyclomatic 78): polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d22f9d14f9e97aaf2af5569469b91db1c1f3e02addcede0939d7ba9e8257c2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::is_sorted_rec (cyclomatic 78): polars_plan::plans::optimizer::sortedness::is_sorted_rec has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e22914be396f2abb284fc272176276e60cb22e5d7f37aeb59c239bb782f5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"series.sequence_to_pyseries (cyclomatic 78): series.sequence_to_pyseries has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/series.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4935e68cc4ecefb004c73ff05fa22a0e1f315f741fe7ed68541b4e24e4cb10b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyValue::strict_cast (cyclomatic 77): AnyValue::strict_cast has cyclomatic complexity 77 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f2b4f1902810f930c3dd9e6b668594f0ed73c046b04a78e3909ea5064ba2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::fmt (cyclomatic 77): Expr::fmt has cyclomatic complexity 77 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/format.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386f8ab8885150c31501eb955695661f21d8b8f28e5b3f2aa119b9b2e3c5c29"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::write::write_impl::serializer::serializer_for (cyclomatic 72): polars_io::csv::write::write_impl::serializer::serializer_for has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"767d17511b4a02f2d0a80320f83266e681597128b7c3e5d243952542f0d505db"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner (cyclomatic 70): polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner has cyclomatic complexity 70 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f2a0d4f121dd0bc9abb098c494c6f442219a8ee4b1ea30c3c428da891aac7"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprVisitor::visit_binary_op (cyclomatic 70): SQLExprVisitor::visit_binary_op has cyclomatic complexity 70 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bdc53f0e0701b6b6f1dbae95827dceb03386e2c59ade2e1ed83176f41e8340"}},{"ruleId":"D1","level":"warning","message":{"text":"Duration::_parse (cyclomatic 67): Duration::_parse has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5da324e9949839188ea6b555418100e3d73a8137b46a4f6899cb210684f146f"}},{"ruleId":"D1","level":"warning","message":{"text":"IR::is_ir_equal_shallow (cyclomatic 67): IR::is_ir_equal_shallow has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/equality.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9185fd6993fc10089f6a44d0f6e1b43fb5bc343108e14be65ab36c9fcf9d4ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnSelectorBuilder::attach_transforms (cyclomatic 66): ColumnSelectorBuilder::attach_transforms has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0998a622da33c38653adcca3c02df8973350f3ed4619bf8b7f8ef99869520391"}},{"ruleId":"D1","level":"warning","message":{"text":"AExpr::to_field_impl_inner (cyclomatic 65): AExpr::to_field_impl_inner has cyclomatic complexity 65 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"19af1a4d59da0522964281061527d99dd8e75349bb151a7cf0e78435d28ae4b6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::process_join (cyclomatic 65): polars_plan::plans::optimizer::predicate_pushdown::join::process_join has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2411dc7688e1b6da0a81bcf0f192600559e63203a8578a6c2ffeaed3a10317"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::execute_select_block (cyclomatic 65): SQLContext::execute_select_block has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa29aa0a1512cd63e91f78cf22a44498b9ac99d8c460c0ae529a40c19967f4c7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprIRDisplay::fmt (cyclomatic 64): ExprIRDisplay::fmt has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f25587cd913fa655f0411e7a8c1a7caa915cfe249e7639bdb0b553873f15578"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::process_group_by (cyclomatic 64): SQLContext::process_group_by has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6271}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd087090dda16f647e435cfc9d740a0cecc2c74b470282f7cecc67e66e24bb"}},{"ruleId":"D1","level":"warning","message":{"text":"_inference.dtype_from_database_typename (cyclomatic 63): _inference.dtype_from_database_typename has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_inference.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2305cd9aaf6e54aa21fff0baddf513280d876127a46b463030208257056a247"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions (cyclomatic 61): polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f266f1ae6f89a84592e77543041cfef2e017be873591131cbe99aa3b863a2a11"}},{"ruleId":"D1","level":"warning","message":{"text":"PredicatePushDown::push_down (cyclomatic 60): PredicatePushDown::push_down has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"353fb4f3ecd79d63b2a4fd4ef272bc6eb11a1d7d16ce8ee60209bdcbd563723a"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyValue::eq_missing (cyclomatic 58): AnyValue::eq_missing has cyclomatic complexity 58 (threshold 15). Of this number, 57 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":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab3910c2f965fc4f7d1968b0e816291aff05a7f91200cfc79602f4fae5f82ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionWalker::walk_rec (cyclomatic 58): SelectionWalker::walk_rec has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3350d1e87c5aea15033bf2ca4090ee9e15ea1d508c3ea01ca4632f27c7239d01"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner (cyclomatic 58): polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a60b13fe2003d22c788c0ecfb13d7b1d6adacd6b62749d394745005d45ef760"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::subquery_pull_up::try_move (cyclomatic 58): polars_sql::subquery_pull_up::try_move has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f197fc9574274451f545999d952b5a85163d377a97539cd36137fc4c87c4fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::_visit_nodes_impl (cyclomatic 58): polars_stream::physical_plan::_visit_nodes_impl has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cf2a0a9822e2e5b1b46a8647a1b5c3140ab756f5ca4b4420afc58608b9b999"}},{"ruleId":"D1","level":"warning","message":{"text":"CastColumnsPolicy::should_cast_column (cyclomatic 55): CastColumnsPolicy::should_cast_column has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"c831bcfbf49374ae7f2a0b9c6ecb461ebe1c6718ecd1e9d99c97b715f0d5dfe2"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprVisitor::visit_expr (cyclomatic 53): SQLExprVisitor::visit_expr has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee398509b64408a5da89638b4011bc6be838dd9aa3d03f15903690611d59800"}},{"ruleId":"D1","level":"warning","message":{"text":"StringFunction::fmt (cyclomatic 52): StringFunction::fmt has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2847799f1d4138c273893ce8988d88f29e456a21578109329cf1bed6c5b789e2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::simple::page_iter_to_array (cyclomatic 51): polars_parquet::arrow::read::deserialize::simple::page_iter_to_array has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"824994af4f6942fc47937415adf1dd0e5feaf6b235d43eae930a230c0e2efc39"}},{"ruleId":"D1","level":"warning","message":{"text":"IRStringFunction::fmt (cyclomatic 51): IRStringFunction::fmt has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/strings.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e79e822fbfe8d13718a10376477e092471ebdde132b5eaff4f3e12d4e41fb40"}},{"ruleId":"D1","level":"warning","message":{"text":"Series::_try_from_arrow_unchecked_with_md (cyclomatic 50): Series::_try_from_arrow_unchecked_with_md 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":"crates/polars-core/src/series/from.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f167077368d791fb4e0e16ee6c6d37e26f08dd0c6afa368dca9aa7cb77d2b714"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::write::schema::to_parquet_type (cyclomatic 50): polars_parquet::arrow::write::schema::to_parquet_type 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":"crates/polars-parquet/src/arrow/write/schema.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a041d177f5817b7c0ce915f148cb099fb8708d3a1e25fe8cea5aeb5373282d0f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_python::lazyframe::visitor::nodes::into_py (cyclomatic 50): polars_python::lazyframe::visitor::nodes::into_py 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":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a323b29765df7629f9cb2afc5da0e713c48b6ffff23f634ce5addb4d2b8d4"}},{"ruleId":"D1","level":"warning","message":{"text":"_write_utils._xl_setup_table_columns (cyclomatic 50): _write_utils._xl_setup_table_columns has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3845c1cbdf1b20af20e8ffdad38ead52ab002400ae9420ca41d393444cc4112"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::schema::get_arithmetic_field (cyclomatic 49): polars_plan::plans::aexpr::schema::get_arithmetic_field 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":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c41a9623c4b882900f124028d2ea9374a59b57dac90ba5defd63abe982ab68"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::types::map_sql_dtype_to_polars (cyclomatic 49): polars_sql::types::map_sql_dtype_to_polars 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":"crates/polars-sql/src/types.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a476905965d0f032f6e4201e93a6b945db31025c543f961d7ffb75f8293dd179"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrameJoinOps::_join_impl (cyclomatic 48): DataFrameJoinOps::_join_impl has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3eace4d8a86651c5f48217ec67a332406d33cdf3f2eddd835daac2d93e547d"}},{"ruleId":"D1","level":"warning","message":{"text":"IRDotDisplay::_format (cyclomatic 48): IRDotDisplay::_format has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"902881ea5df7eaa8bdb0b1cbf04a1326d870967a6958fb0168b6f9c6551c86bf"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::cse::cache_states::set_cache_states (cyclomatic 48): polars_plan::plans::optimizer::cse::cache_states::set_cache_states has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/cache_states.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa5368dcf9761cb6fa689641645b1e8eab0d36ef998900d4b84da1705debd07"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_database (cyclomatic 48): DataFrame.write_database has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4f06436f062e3e7a7bf8df308e0c9f978a7d254ec61eb1866831071b0aac45"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame::fmt (cyclomatic 47): DataFrame::fmt has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5563cf741536fe409f881092a295054acdec82cf95f7fe0b7c7bdd337f49384"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::ir::format::write_ir_non_recursive (cyclomatic 47): polars_plan::plans::ir::format::write_ir_non_recursive has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c9cd1703944692fd3f9b9afd869c094aa6a9418b6a8232cdd7ccd5e8c9da96"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::optimize (cyclomatic 47): polars_plan::plans::optimizer::optimize has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"243b7fd6913f4cd9951c716b0475eafd6720e73e693e52c4689ce2d4fa309402"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::group_by_in_derived_table (cyclomatic 47): SQLContext::group_by_in_derived_table has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_group_by.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd16ac9ab12810d3be003670a94fa60a6f7aee79e2283b98e350c2b13b5a33a4"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_expr::reduce::convert::into_reduction (cyclomatic 46): polars_expr::reduce::convert::into_reduction 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":"crates/polars-expr/src/reduce/convert.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b004b727dc0c39aed65b905838851ef0f7a87b436ec7ffd7dbda85e365f39ed"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::schema::get_truediv_dtype (cyclomatic 46): polars_plan::plans::aexpr::schema::get_truediv_dtype 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":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"496df2eeb2a3fe853c479527d84033b05db05afbdce4c0b358a65b11a6bc378b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::sql_expr::parse_extract_date_part (cyclomatic 46): polars_sql::sql_expr::parse_extract_date_part 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":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6f6222b32ae2f95a50f1697de6de87cbe84b5edfc0e22ed32ba24bd6c7f79"}},{"ruleId":"D1","level":"warning","message":{"text":"IpcFileReader::begin_read (cyclomatic 46): IpcFileReader::begin_read has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177900aef1f000439d0b3671f4805aca59d50d08e0fa23e7c4285d59191f8a7"}},{"ruleId":"D1","level":"warning","message":{"text":"lit.lit (cyclomatic 46): lit.lit has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lit.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df16a769a23d770556aac33f4e1e1c46486ede92156c29594133c9239c08a52"}},{"ruleId":"D1","level":"warning","message":{"text":"functions._read_spreadsheet_calamine (cyclomatic 45): functions._read_spreadsheet_calamine has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c01e5d268bdd48a8b261fa30d663ac4a793a838e336f996473f4a1f3e48ab"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_mem_engine::planner::lp::create_physical_plan_impl (cyclomatic 44): polars_mem_engine::planner::lp::create_physical_plan_impl has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3359e51a18771d309fabdc174654b79473f640928cb7447c497313d2c5e09247"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal (cyclomatic 44): polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal has cyclomatic complexity 44 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 6 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":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaebcfef3526489d1054bf663bd0f71c3bf3d4621b5117b8443a58cee38425d"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeSortedNode::spawn (cyclomatic 44): MergeSortedNode::spawn has cyclomatic complexity 44 (threshold 15). Of this number, 43 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":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c11bd754e4288dc989577b6fd3edcfda5bd2345f8e90f81e1780fc59772f834"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::from_arrow (cyclomatic 43): DataType::from_arrow has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/field.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f32cff1b34ec3f85fe20658a48336bb3b8a40fcda5f9aa2046814d572a879"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderStarter::run (cyclomatic 43): ReaderStarter::run has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b3b0e1cf6abd24bdfe2892ad01ae14cd47a751eea2e64c64448eda6a7fd75"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::write::array_to_page_simple (cyclomatic 42): polars_parquet::arrow::write::array_to_page_simple has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c184b524a95f212a243ebb070771f508ad4c2bb3230ec1ca4d493aab2333dd69"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::lateral_join (cyclomatic 42): SQLContext::lateral_join has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c170ada5570e10776eb86148ff632340f711ca388b9c64bad22a48c30dfb75a7"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr (cyclomatic 42): polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f71859d1c8ed279310017981bb656926b40099a7ad534707b1eb70186e6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"TernaryExpr::evaluate_on_groups_impl (cyclomatic 41): TernaryExpr::evaluate_on_groups_impl 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":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcda7d825564d58a3d3bc5162f95d9f421988fa6d8254acf8b1346ac52d5013"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::path_utils::expand_paths_hive (cyclomatic 41): polars_io::path_utils::expand_paths_hive 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":"crates/polars-io/src/path_utils/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f43868a48fde6d8a81b12001360d0159c82e41bccb5d78d8f8ebc99ac99f19"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::unique::unique_counts (cyclomatic 41): polars_ops::series::ops::unique::unique_counts has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/unique.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe28dedaa5c46092260530b313f75aba342029f51bb0f44f23c4d5d45f4e30"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::join::resolve_join (cyclomatic 41): polars_plan::plans::conversion::dsl_to_ir::join::resolve_join 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":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f2e1a6b1d7d687a1d59bdc68146da769316ef4d8ed3e9e5c305ff169ad6023"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility (cyclomatic 41): polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"323b9d2b00285a417eaa01c93831baa9a63caba3edb128f74a759f908033bc04"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline (cyclomatic 41): polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c79093a63442a06d836334001a922cc18187a122b951189ec3c35027af74e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::try_to_arrow (cyclomatic 40): DataType::try_to_arrow has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbe4cfd7d89981a2829b7fc53341792524fcb930312c7ce317b941f09c37307"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::python::pyarrow::to_pa (cyclomatic 40): polars_plan::plans::python::pyarrow::to_pa has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"717704b386afbb823aba99469ef56e4736eedb3eceab1afa8e3c1251058e0f66"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::to_description::ir_props (cyclomatic 40): polars_plan::plans::to_description::ir_props has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff70e55d205802134c2eac8dd99207bf7dc8d97db310b9f4e5445b386e08c7f7"}},{"ruleId":"D1","level":"warning","message":{"text":"NDJsonFileReader::begin_read (cyclomatic 40): NDJsonFileReader::begin_read 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":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"21758188e6020e5cb193da424f4fe8337a5ae3b92997cc1c30e446bb31aeb71f"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTypeSelector::fmt (cyclomatic 39): DataTypeSelector::fmt has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"74af7f2d78049ef0f2a06c24e6dfaf6c528f37d4695f380b019408556108defa"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::ir_to_dsl::node_to_expr (cyclomatic 39): polars_plan::plans::conversion::ir_to_dsl::node_to_expr has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e023c9ab2aad0d7c4054354ce081c887507f5728d502a3effe950d5466960840"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::fmt (cyclomatic 38): DataType::fmt has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c6749ae715d4ab1f8f439a265e2e0873826d15f90251244395e44bbf3c4d25"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::column_expr::is_between (cyclomatic 38): polars_plan::plans::aexpr::predicates::column_expr::is_between has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90645dea4208e90488e1d2f0da19591faf543bf931bb90f02103c822a0dda77"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::can_cast_to_lossless (cyclomatic 38): polars_plan::plans::conversion::type_coercion::can_cast_to_lossless has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3d8ce7abb9fbb23a472aea0eba34399935018051c0633ed0a5b1973f762a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::try_attach_join_membership (cyclomatic 38): SQLContext::try_attach_join_membership has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"644edaf10f1ef24df989a68944171cf94debe72e028a8b399f6a883ec7c79c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToArrowConverter::array_to_arrow_impl (cyclomatic 37): ToArrowConverter::array_to_arrow_impl has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5b1728454e200f1c63ce7cc1f62a6d802504233d7cc6c66010b5a537b1f5e3"}},{"ruleId":"D1","level":"warning","message":{"text":"IRListFunction::get_field (cyclomatic 37): IRListFunction::get_field has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b8954c792e64d04a58857288bb588ddf166fd1978d4bda76ea08687f64b8f0"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::stats::node::node_stats_with_cache (cyclomatic 37): polars_plan::plans::stats::node::node_stats_with_cache has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dbdeba476e61ac1981db8807fba112e7635e827590633fd6aedafe4d61b492"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyPolarsSlice.apply (cyclomatic 37): LazyPolarsSlice.apply has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/slice.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f7cc3c38b053485a3bf451c6ae6fb6e0fc5c9d63a13914cceaf1d286fd99f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::column_expr::specialize (cyclomatic 36): polars_plan::plans::aexpr::predicates::column_expr::specialize has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef53e74454325ad152c8e4a76301406244baeed72dd0af13b93f50dfc7624b1"}},{"ruleId":"D1","level":"warning","message":{"text":"PySeries::to_list::to_list_recursive (cyclomatic 36): PySeries::to_list::to_list_recursive has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/export.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27d70dd1952126f129ceece322be55a3d0604c345ebf16c5f2e72df48bda10"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetReadImpl::init_morsel_distributor (cyclomatic 36): ParquetReadImpl::init_morsel_distributor has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdadc572385b23041f7369f2782ac6ad4aeae52f8b6205e60ec21404c513b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Selector._by_dtype (cyclomatic 36): Selector._by_dtype has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e865034e2c466af86f1a007d7c182e80dceb4d553c0f06e022badc75bf60bdc8"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregationExpr::evaluate_impl (cyclomatic 35): AggregationExpr::evaluate_impl 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":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5d27568ffb08afd5d9aa9fd334e575b5f211f998f042974b23741bc0ece01"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::write::array_to_page_nested (cyclomatic 35): polars_parquet::arrow::write::array_to_page_nested has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"202ebd822e629a1f51bac1533479e202a04903471f0e3d4cf66e9e08e83c0f77"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryExpr::evaluate_on_groups_impl (cyclomatic 34): BinaryExpr::evaluate_on_groups_impl has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/binary.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"02741e2b03634eaf1c873836d27bbcd2bc207bd77eae4b413688b34505e416ef"}},{"ruleId":"D1","level":"warning","message":{"text":"IR::hash_excluding_inputs (cyclomatic 34): IR::hash_excluding_inputs has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/hash.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"798af8ead1ca390e92777c0dd43ac43fe3993e6e957447cf7f9669489078415d"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeFmtNode::node_data (cyclomatic 34): TreeFmtNode::node_data has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350e08f54474e566391c839c5a6e981efe4d4c82e5d9c0d9c364f016911f017"}},{"ruleId":"D1","level":"warning","message":{"text":"EquiJoinNode::update_state (cyclomatic 34): EquiJoinNode::update_state has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5335a8edff2f3e710ec49a43298dd0b987a5543c9608e287ce7282f5210b6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SemiAntiJoinNode::update_state (cyclomatic 34): SemiAntiJoinNode::update_state has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"35672120e7a976d555db190f42108a42d958443700a1882922019281aff88ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"InstructionTranslator._expr (cyclomatic 34): InstructionTranslator._expr has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e01d0607676b128362c3200649ff234eef1876b363b266d84e790ad54a10e6"}},{"ruleId":"D1","level":"warning","message":{"text":"general._from_dataframe_repr (cyclomatic 34): general._from_dataframe_repr has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/convert/general.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e2186fae1eb5fb243a207c550ca70dfe096785ceadaece0031ba82209a6cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"Series._comp (cyclomatic 34): Series._comp has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf4458a2019497983ca2b41693d2dbe3d11acc950fc767cc36eb63750a5322"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyExpr::evaluate_on_groups_impl (cyclomatic 33): ApplyExpr::evaluate_on_groups_impl has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"462b7ac6ba90b73d1bf5ea697865355416391c504908aa027d0418ce09422cec"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_json::json::deserialize::_deserialize (cyclomatic 33): polars_json::json::deserialize::_deserialize 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":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"83694d12e0e7d5e722639c9749d0bbe40f00f1e38a7b250e25bb52f58aff2572"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_excel (cyclomatic 33): DataFrame.write_excel has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6057b526896eae0f0f89d503bba0beccbc37c61283e5a6a2945bf270ab5aeaa3"}},{"ruleId":"D1","level":"warning","message":{"text":"_partition_evolution.spec_change (cyclomatic 33): _partition_evolution.spec_change has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcb5ac3580bc38c65f10cce821c8a032a733b3af65b030995615b54fd60012"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::utils::supertype::get_numeric_upcast_supertype_lossless (cyclomatic 32): polars_core::utils::supertype::get_numeric_upcast_supertype_lossless has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d4e99a586adf7d9cd6b342fbdf975158c5f7c1c245250f86b73f4bea5663df"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_expr::planner::create_physical_expr_inner (cyclomatic 32): polars_expr::planner::create_physical_expr_inner 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":"crates/polars-expr/src/planner.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecce4acdbdd808a822b434e3fd1d524b76ee0eefd19595a93d446ad1ccedd4d5"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::ndjson::buffer::deserialize_all (cyclomatic 32): polars_io::ndjson::buffer::deserialize_all 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":"crates/polars-io/src/ndjson/buffer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"17464f215da158e88cf73bcc6b69c3d16d3af6fa040529fac2a8e0effa8069f7"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info (cyclomatic 32): polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91359bca57ad8123fbcdb6a462321063b2683776b72e29de6d4a9a635e21793"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::try_decorrelate_scalar_subquery (cyclomatic 32): SQLContext::try_decorrelate_scalar_subquery has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfc1f4ace6241f3447ab63f433272bbc14f24034e58dc5f82bcc164177c5a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::lower_expr::is_input_independent_rec (cyclomatic 32): polars_stream::physical_plan::lower_expr::is_input_independent_rec 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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"49afef37a7ea5aeed8def58f670d2b5fcb77b480d53f3f464f98fc1d0612c888"}},{"ruleId":"D1","level":"warning","message":{"text":"context._alter_catalog_table (cyclomatic 32): context._alter_catalog_table has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb0cd92603550d93c7f3e6328057f5ec03f9b9d8ec5824608829c50520f690d"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregationExpr::evaluate_on_groups_impl (cyclomatic 31): AggregationExpr::evaluate_on_groups_impl has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"35243d0d70be87f48eb31be7d495cf8cc12c289ce7172dcb26691509d791ff9e"}},{"ruleId":"D1","level":"warning","message":{"text":"PageDecoder::collect_predicate_flat (cyclomatic 31): PageDecoder::collect_predicate_flat 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":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b8df9c5df6330a46ba21336b9f420b1618e8b25019a5dcef88f7c961ce9a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats (cyclomatic 31): polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats 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":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b0d11cc74d6ff8f8d5c9cf9f654edca50e26826c6606fbd5393568be704a86"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top (cyclomatic 31): polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top 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":"crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"365ae83d9179818bba1ea54a1e8fd3787f5aab201b9871f78c929457a49ae678"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::aexpr_sortedness (cyclomatic 31): polars_plan::plans::optimizer::sortedness::aexpr_sortedness has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a693c8d5fe13046d86d136ce866280604f084a8dc683910f47ccd11f1b8c8231"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::encode::get_encoder (cyclomatic 31): polars_row::encode::get_encoder has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eacd8a5f277199db0089105258cbb54ed81d103e504f94b45e2d8af00c0da9"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges (cyclomatic 31): polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges 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":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab9d0a2d56b90aac0a8092b676bd2c1435f0040073911ca7cb7a1a12616d344"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe.numpy_to_pydf (cyclomatic 31): dataframe.numpy_to_pydf 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c195bbb0573e6d31b9c14151c2b49b61868fc306fb1c2fd24525dd4ff689f4f4"}},{"ruleId":"D1","level":"warning","message":{"text":"functions.read_csv (cyclomatic 31): functions.read_csv 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":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"006038094ffc66ab7456c610b5076cc29cd6c72130cafaa6c62242406453f60e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaDataset.to_dataset_scan (cyclomatic 31): DeltaDataset.to_dataset_scan has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_dataset.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1784a2193a6fe6c881a4756b0a3f6c983783ad1cdfeb2e4d51d75710c4db8d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaSinkState._commit (cyclomatic 31): DeltaSinkState._commit 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":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e2627d616b5cd04702b9a3b00fc9ef9976f8efab5cbd056cafec921aebe53"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::write::write_impl::serializer::string_serializer (cyclomatic 30): polars_io::csv::write::write_impl::serializer::string_serializer has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec38843097de10f87583f5e98f9624e2cff16febd082229ef5580f3f5b1fb6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::frame::join::merge_join::gather_and_postprocess (cyclomatic 30): polars_ops::frame::join::merge_join::gather_and_postprocess has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4248d10533ca4833c5a2ce68c4a9b10267bb526398f67dc8639e2faec7ea6ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"IRTemporalFunction::get_field (cyclomatic 30): IRTemporalFunction::get_field has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: IRTemporalFunction::fmt (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/datetime.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab4e48fb6ed7e5fe53444345c7a7158c1106013036765cbbec35ab66a521239"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::cluster_with_columns::optimize (cyclomatic 30): polars_plan::plans::optimizer::cluster_with_columns::optimize has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cluster_with_columns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a150c5a7f5cb24e9bac5dd07a405cc698ac9877eccf4c706ec1d8e4a75fbddb"}},{"ruleId":"D1","level":"warning","message":{"text":"functions._read_spreadsheet_openpyxl (cyclomatic 30): functions._read_spreadsheet_openpyxl 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c332857c030c12d3da757161a29d11386f9118372b143ae202f28ae36f33283f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::utils::unspecialized_decode (cyclomatic 29): polars_parquet::arrow::read::deserialize::utils::unspecialized_decode has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f20392967ba3566d7442610f148a83431f7db3e02ed6211b4b30b4a457a623c"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::dsl::datatype_expr::into_datatype_impl (cyclomatic 29): polars_plan::dsl::datatype_expr::into_datatype_impl has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/datatype_expr.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21ee8420cdadef79e9b51640b882a5cdacb29cc06d0d43465aa226482a6bb7"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir (cyclomatic 29): polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a621f63588d44592e4225a439b06013c0844b7faccc7c0bcdfb90e5e4d9d49e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::membership::resolve_needle (cyclomatic 29): polars_plan::plans::conversion::type_coercion::membership::resolve_needle has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/membership.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bdb6baa3b5e8d134ce2e5c5533bef3d1e8ee53051609bf74c9f6550c4785ec"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::extract_window::extract_from_projection (cyclomatic 29): polars_plan::plans::optimizer::extract_window::extract_from_projection has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/extract_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bce2c54af8b7ee70a95032790ff2bdf8f9024a3826a581d74a1cd84533a0b83"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::encode::encode_flat_array (cyclomatic 29): polars_row::encode::encode_flat_array has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9d6de4cd50b152a195e5b2b58fd634e44f7fef62fd332101dab6af18caf80f"}},{"ruleId":"D1","level":"warning","message":{"text":"SampleState::try_transition_to_build (cyclomatic 29): SampleState::try_transition_to_build has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7da243137ea6e3a1f89ce4327458e27adbf6e4eae48525e9e3c24fbb0f5b15"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::decimal::str_to_dec128 (cyclomatic 28): polars_compute::decimal::str_to_dec128 has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d858bc3867d1a6f36abfdf35ec00e83059943a19910aceddac2c418529efae9"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::statistics::deserialize_all (cyclomatic 28): polars_parquet::arrow::read::statistics::deserialize_all has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/statistics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f3d18b71dd4d5fc7bb885f86a441df23e8a3d62fb6416f0f6067e6ff9fca1f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeFmtAExpr::fmt (cyclomatic 28): TreeFmtAExpr::fmt has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e632da3f44787061903fb1d7f350e859920b8ad5f18a8fdb952e6cdcf1a986"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::projection_height::aexpr_projection_height (cyclomatic 28): polars_plan::plans::aexpr::projection_height::aexpr_projection_height has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/projection_height.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e48b4c0f5fc191d96665f546c0dd9494034e3c087875014ff7897e56fe7faf"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::join_inputs (cyclomatic 28): SQLContext::join_inputs has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5413980f1629ca8c9bafe88bae4cd2614ff994bd8acd8e7a7e2fc7c3279964e0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLFunctionVisitor::visit_window_aggregate (cyclomatic 28): SQLFunctionVisitor::visit_window_aggregate has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/window_frames.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5d38be573f7225ba291a4d4b313f44ca415df1ad21a50c3ee561a76b5fa32"}},{"ruleId":"D1","level":"warning","message":{"text":"DtypeVisitor::visit_rec (cyclomatic 27): DtypeVisitor::visit_rec has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: DataType::fmt (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":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9110fb626e3d1791533eae5e93a34b1c7e30cf4d72641942dfc143b69c790df"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::parser::parse_lines (cyclomatic 27): polars_io::csv::read::parser::parse_lines has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4983b0d5200a0a4a4e56f1c6119513b5e2c83f1e379236c9f39d402c26000e88"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_runtime_filter::process_join (cyclomatic 27): polars_plan::plans::optimizer::join_runtime_filter::process_join 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":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b304d3b0cb905fcf3e89b4dc34625506394ed7727a22e5e32f602a7e9fce9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl (cyclomatic 27): polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7843758e7f3887113e5f1ff2588b534ee286a5b2af4bcb7dc20761b85b2a7a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_python::conversion::any_value::py_object_to_any_value::get_conversion_function (cyclomatic 27): polars_python::conversion::any_value::py_object_to_any_value::get_conversion_function has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: polars_python::conversion::any_value::any_value_into_py_object (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"353ef4a1650ccf45a7f609a2a90f019278b3f7aff4f773eea9feabc225c05673"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::encode::fixed_size (cyclomatic 27): polars_row::encode::fixed_size has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c05baef1671e5585c3424d2391c3935fa359841caffeb91e1ebde059ac31268"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::try_decorrelate_in_subquery (cyclomatic 27): SQLContext::try_decorrelate_in_subquery 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":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a708b69f2f766528d8aa7ebb67eed7474bf81dd96adcebd7766ccf3308eb409f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::subquery_pull_up::prepare (cyclomatic 27): polars_sql::subquery_pull_up::prepare has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca578b759905359651a2fdbda1f358fd197cd259d6bfb0721d2d224069878b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkState::spawn (cyclomatic 27): SinkState::spawn has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/sink.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f797cb20c6194893f6e170a42f0a89a5db2b251c9501d1a402076169722b42"}},{"ruleId":"D1","level":"warning","message":{"text":"Shared::run (cyclomatic 27): Shared::run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/flush.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b0e98634b07a184f86311128a075500c6b7648c0c2ff331491e1727a0f6d78"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::nodes::joins::merge_join::find_mergeable_search (cyclomatic 27): polars_stream::nodes::joins::merge_join::find_mergeable_search has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70bb075718b1869e936d4895c113dc4807055aaaa991d997e8435333c9039a"}},{"ruleId":"D1","level":"warning","message":{"text":"getitem._select_columns (cyclomatic 27): getitem._select_columns has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"624fa5166ac0c97691f5a0d8baa370bfdf28eef915f4e92b9ae831392c3f6d16"}},{"ruleId":"D1","level":"warning","message":{"text":"eager.concat (cyclomatic 27): eager.concat 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":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b2aa9102b3124eb1472c73a74479cd8caf661c7634baf509771c270a38605"}},{"ruleId":"D1","level":"warning","message":{"text":"Series.__init__ (cyclomatic 27): Series.__init__ 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8851ca222f3d709feda60430419d74beb56e183af5f34a5abbbd1ecd4582cbd"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::binview::decode_plain_generic (cyclomatic 26): polars_parquet::arrow::read::deserialize::binview::decode_plain_generic has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781c594dfcbd287042e28950e3ad7496fc6a7dce2071d62ccd78644d0e9e15a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::write::dictionary::array_to_pages (cyclomatic 26): polars_parquet::arrow::write::dictionary::array_to_pages has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/dictionary.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"563dcf9f373afbba2ad2f7fe803476a0c7b9924c1ccc19c5994b676635e85b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers (cyclomatic 26): polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3eb3ca6554ab611a51265c09b3ac1cd7e2b6121dc686b30dadcab4402a2e47"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_binary (cyclomatic 26): polars_plan::plans::optimizer::simplify_expr::arity::simplify_binary has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f894184d01f6f0d5bbdf5ece74d234c5758c8b36bc6c9a5e736bfed2c10407"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::stats::value_range::column_value_range (cyclomatic 26): polars_plan::plans::stats::value_range::column_value_range has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/value_range.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e273fdfdee68b9df69a680a290c0d9887cbf6b047a1c5726101c0de98433f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::process_join_on_subqueries (cyclomatic 26): SQLContext::process_join_on_subqueries has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"747a6e6f11cad0f7a98feaae3629f17c551fdb1913edbd582f7cd90d56e0223a"}},{"ruleId":"D1","level":"warning","message":{"text":"PartitionDistributor::run (cyclomatic 26): PartitionDistributor::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4874d98a02bd765a7aaf02f9b113e025b36f6582e234cf8b1db1b7015ffa31"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbePartitions::partition_and_probe (cyclomatic 26): ProbePartitions::partition_and_probe has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f447a310c52132aac1bcb68d2a78971ac3af9d823eb9347a03ee93a1f064fdaf"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe._expand_dict_values (cyclomatic 26): dataframe._expand_dict_values 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8689ea4666689e4e8b6f11905b698144f6b695544a0d054f29cd9c8cfb993779"}},{"ruleId":"D1","level":"warning","message":{"text":"_utils.prepare_file_arg (cyclomatic 26): _utils.prepare_file_arg 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. This shape REPEATS in the file: one other method here (_utils.prepare_file_arg) 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":"py-polars/src/polars/io/_utils.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb53394b14d40950f2fd69a3d5f70d97e4b03cee7eeecf151bbf81d6702b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"_utils.prepare_file_arg (cyclomatic 26): _utils.prepare_file_arg 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. This shape REPEATS in the file: one other method here (_utils.prepare_file_arg) 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":"py-polars/src/polars/io/_utils.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"60828cd78540c485755d26a95d4349503647ef5ec0f0580ad79833195b55b120"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyFrame._filter (cyclomatic 26): LazyFrame._filter 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04b01f987e7833b414cd0723ec9971e6967fcbf64c4dc1c51f56c046c8156a6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyValue::extract (cyclomatic 25): AnyValue::extract has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: AnyValue::partial_cmp (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3093a3e1b1250c4da41d66ca586de557df2e1145d36f17ff9d247985c95b1d73"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::can_cast_to (cyclomatic 25): DataType::can_cast_to has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: DataType::fmt (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":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8251ffdaf39a5ae52a8bae3f40f65a2328e6728547430f5a81daa3886e9a0932"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame::sort_impl (cyclomatic 25): DataFrame::sort_impl has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea5afec3bf12affb35c364d72d79e2a10740172b832473382537d4ce2c1d6d0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyValueBufferTrusted::add_physical (cyclomatic 25): AnyValueBufferTrusted::add_physical 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. This is NOT this file\u0027s highest cyclomatic complexity: AnyValueBuffer::add (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d57e370d2736a5d9750aa7ef19334f7eea15dfe9e9e69cc69e7ca60f1718a2"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericFixedSizeListOpHelper::execute_op (cyclomatic 25): NumericFixedSizeListOpHelper::execute_op has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb237cecd341ca1bfc99d03d00ff49ba1e807d6b486859fcc07fe2bfc879819d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::chunked_array::ops::append::update_sorted_flag_before_append (cyclomatic 25): polars_core::chunked_array::ops::append::update_sorted_flag_before_append has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/append.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f63b3e9b7142c5ff402fcdac0921f202821f7c636d4dc2c54bd944911e6d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::builder::init_builders (cyclomatic 25): polars_io::csv::read::builder::init_builders has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02d93fc53e0f96dddf649d69b5338887b73b6b7df6ff716e74f9ff606bf259"}},{"ruleId":"D1","level":"warning","message":{"text":"SourcesToFileInfo::infer_or_parse (cyclomatic 25): SourcesToFileInfo::infer_or_parse has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc3e2b82dc826a442ef71d0f7e046c9b9e4928e2d1f330349e83d99fa885244"}},{"ruleId":"D1","level":"warning","message":{"text":"Wrap::extract (cyclomatic 25): Wrap::extract has cyclomatic complexity 25 (threshold 15). Of this number, 22 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. This is NOT this file\u0027s highest cyclomatic complexity: Wrap::extract (cyclomatic 63) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec67a536e9f079a9264bcec4712a1ba646a7a70df930c6267760ec193b85cf5c"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvFileReader::begin_read (cyclomatic 25): CsvFileReader::begin_read has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d31c609b2a16c5673c92d796be3bc22d1ad5b9d6d5306153ec618181548b9fe"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyFrame.describe (cyclomatic 25): LazyFrame.describe 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dacc74900552530a5209733f1887731c9a0ffe2b2f3e4e2293a3bbd8712806"}},{"ruleId":"D1","level":"warning","message":{"text":"data.data (cyclomatic 25): data.data 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":"py-polars/src/polars/testing/parametric/strategies/data.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b67998273f0219fec1cf12d5841fb0f1a9e375af62b92020a0bb37eb63611e"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame::to_ndarray (cyclomatic 24): DataFrame::to_ndarray has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ndarray.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da378ce4c0b89493c6d4034722662c3644ca1781c6e42f970666797fdd10724"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreReader::parse_csv (cyclomatic 24): CoreReader::parse_csv has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9b3fc72cdad394cec11665bc8ba4bc211b212521ac8fa03b7eb248f28ad46e"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitFields::next (cyclomatic 24): SplitFields::next has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/splitfields.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6e6b6a7ab7a37679eba760e9900074a79cf5ebfec2c5dbe63774a39b521f74"}},{"ruleId":"D1","level":"warning","message":{"text":"LeafRows::collect_run (cyclomatic 24): LeafRows::collect_run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8a18fb2879c6566dd7b1bba52f4fcb9de4796630004f78e28fe94fc16fa586"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict (cyclomatic 24): polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db6b85c41bff6339bb067d95d3d83e170273f0f895e35adf4dce433b250540"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionIR::eq (cyclomatic 24): FunctionIR::eq has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/equality.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4af426f2fd03d7e8b43f631be9663aa48bb7ad6dda989a647f2163f36da7ec"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_runtime_filter::scan_origins (cyclomatic 24): polars_plan::plans::optimizer::join_runtime_filter::scan_origins has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0641300dcafdaa955d56ad7976cc064411e0b1cecd38124c820b585f5dc0e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::decode::decode (cyclomatic 24): polars_row::decode::decode has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/decode.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a6cd598f4f4acc779009c643248b9aa75846ca44ecae97a0612b0967bb7e41"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBatchSource::run_parallel (cyclomatic 24): LineBatchSource::run_parallel has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c4041a0c63e448b6e2416a9ad57eb4776d60824e129a20cf40b3f337a3e59b"}},{"ruleId":"D1","level":"warning","message":{"text":"RowGroupDecoder::row_group_data_to_df_prefiltered (cyclomatic 24): RowGroupDecoder::row_group_data_to_df_prefiltered has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"722b99dc52846ba705f7c424dca7efb942327bf17472a85b273e5d1f5e592bda"}},{"ruleId":"D1","level":"warning","message":{"text":"ZipNode::spawn (cyclomatic 24): ZipNode::spawn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/zip.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48439198452ca683cc3900b7fd3653eac4b0b6109bdfe4c81da5d5cc2d932b8"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.__init__ (cyclomatic 24): DataFrame.__init__ has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a2969017005e3b80145d3ef5ab9ddfd5628a5fde8fdade3e91837c731e82bf"}},{"ruleId":"D1","level":"warning","message":{"text":"eager.union (cyclomatic 24): eager.union has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6de2116e012c7bbe5d9a439c2e48becd8c048743101eedc6b81a613a8e425b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionExecutor.execute (cyclomatic 24): ConnectionExecutor.execute 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":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110404ea2cb18eb51ffd3238ba2745021351bc6e8c0b388b7cd456e70c200dd"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::cardinality::estimate_cardinality (cyclomatic 23): polars_compute::cardinality::estimate_cardinality has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cardinality.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"67416e729baedf4086f459ae2848bf0858574e723439e0aecc176291172d468a"}},{"ruleId":"D1","level":"warning","message":{"text":"StrpTimeState::parse (cyclomatic 23): StrpTimeState::parse has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/strptime.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443e9dda925e8a18ad357a7f52b8df5d1a71356098369ca814ffb4584984211"}},{"ruleId":"D1","level":"warning","message":{"text":"ListNumericOpHelper::_finish_impl (cyclomatic 23): ListNumericOpHelper::_finish_impl has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (combine_validities_list_to_list_no_broadcast, combine_validities_list_to_list_broadcast_right, check_mismatch_pos). 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":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"db87d3e11bf0d54f9f7b84b94478bd3ac9686239164af69a594052a552f68f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Series::cast_with_options (cyclomatic 23): Series::cast_with_options has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 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":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc0ade4d9eb5782a2eb132205075a0793271bfc7733ce35a11a43bfe24b6be"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalExpr::evaluate_on_list_chunked (cyclomatic 23): EvalExpr::evaluate_on_list_chunked has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cefeec7a78a722eb3be867ee4e20873800d7126f05f619fc1fb742bd802b64"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalExpr::evaluate_on_array_chunked (cyclomatic 23): EvalExpr::evaluate_on_array_chunked has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"521631cb2209910675c35ca681cb6b62863c3d2bdcb447d807f46ac562d4ffc5"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowExpr::evaluate_impl (cyclomatic 23): WindowExpr::evaluate_impl has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53effd8af47b09a97a9f0b03c5d6ab23def65d5ad5f228a75b8437a6f133090"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcurrencyController::spawn_control_loop (cyclomatic 23): ConcurrencyController::spawn_control_loop has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"229370db2df8bc5d3e1e1cacca9661eb23d4a297eacd872e6052414279c50a74"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::index_of::index_of (cyclomatic 23): polars_ops::series::ops::index_of::index_of has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/index_of.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"030e942167dcadf1e3b206292fdd1a0a8054cf68fcdfe7167b33451a8fb57e9b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::order_keeping::order_keeping_column_rec (cyclomatic 23): polars_plan::plans::aexpr::order_keeping::order_keeping_column_rec has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/order_keeping.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3a0c396d5ffe018d57b609096d977784527a9d8d4f068f3f1191ce8eb8e5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::hive::hive_partitions_from_paths (cyclomatic 23): polars_plan::plans::hive::hive_partitions_from_paths has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/hive.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c7510b686acd90853eabaa743ca587359330e07321977b6712c2f8520d209"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::optimize_len_or_null_count_cmp (cyclomatic 23): polars_plan::plans::optimizer::simplify_expr::optimize_len_or_null_count_cmp has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c3e126a0dff27e8cb4f5fd5bdbaf5bdb87ebaf8570793b7e7f3c83431ba95d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::function_expr_sortedness (cyclomatic 23): polars_plan::plans::optimizer::sortedness::function_expr_sortedness has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"7909a395d8e71f2ee0c709d0f8d813ac267853464d7c61824fafb49bf4df6d97"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_python::io::iceberg_plugin::v1::convert::import_output (cyclomatic 23): polars_python::io::iceberg_plugin::v1::convert::import_output has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/io/iceberg_plugin/v1/convert.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc095890b22f244ec7a90645aa0cfe38796715f4adff0b423be6df9d988cc08"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::decode::dtype_and_data_to_encoded_item_len (cyclomatic 23): polars_row::decode::dtype_and_data_to_encoded_item_len has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/decode.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bef5b8b5d7cd14951a19328b7a73b79beefe21524f4434d9489c8095057a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::execute_joins (cyclomatic 23): SQLContext::execute_joins has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"5460d744c3b4c5c364177c997cf6924db44178ecb3ef859b1bab4c46b0f67b63"}},{"ruleId":"D1","level":"warning","message":{"text":"PolarsTableFunctions::read_csv (cyclomatic 23): PolarsTableFunctions::read_csv has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/table_functions.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d334dca0fa30b57ac44b4ca318ddd29d61f791c4461f2cc96095731499c80479"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineBudget::acquire (cyclomatic 23): PipelineBudget::acquire has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2df80af5307d93a6fe79ca87599fd7b0462bea6dd6abcb0452628c9144f493"}},{"ruleId":"D1","level":"warning","message":{"text":"_parse.parse_py_type_into_dtype (cyclomatic 23): _parse.parse_py_type_into_dtype has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/datatypes/_parse.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cf5beff5ec753f5159fb0178633d83d43f5269bb21dee317c4cf7bf736a639"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergSinkState.new (cyclomatic 23): IcebergSinkState.new has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e725894175fcbe6808f4e14db7f95cacf85588c52b0819c86d4f1b4e2d821f0"}},{"ruleId":"D1","level":"warning","message":{"text":"core.series (cyclomatic 23): core.series has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/core.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a56f5825222dd467173c0f157bf770f35f6716ef1ac1bb32894f205046246"}},{"ruleId":"D1","level":"warning","message":{"text":"AggMinMaxByExpr::evaluate_on_groups_impl (cyclomatic 22): AggMinMaxByExpr::evaluate_on_groups_impl has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1085ff5fb84c84b1c35adcedcb236b87101291c228d39c10906957dc8e6e65"}},{"ruleId":"D1","level":"warning","message":{"text":"StructEvalExpr::evaluate_on_groups_impl (cyclomatic 22): StructEvalExpr::evaluate_on_groups_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":"crates/polars-expr/src/expressions/structeval.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"41452fddb7624a22be66e6f5a85664f9af935a40393ab9b8fbabfe67db527c04"}},{"ruleId":"D1","level":"warning","message":{"text":"TernaryExpr::evaluate_impl (cyclomatic 22): TernaryExpr::evaluate_impl has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a82f2c7659f76ff73bb31b0523186736b1c1df84146bffde40bf5349a6aef6f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_expr::dispatch::misc::corr (cyclomatic 22): polars_expr::dispatch::misc::corr has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 3 function items inside it that branch (covariance, pearson_corr, spearman_rank_corr). 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":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c6c2fcbb7615fc3672e0cf5933810002ce1e71c98750801e22f3b9272bbdf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::try_open_check_latest (cyclomatic 22): Inner::try_open_check_latest has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/entry.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"38287acaa995b7c4a917597aa9df6663fc9342ca9b69a43eda7e2e3c65c1c2f6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader (cyclomatic 22): polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::read_until_start_and_infer_schema) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2328f9af010ef8a1ebc30696996bfadb81da2b14ce1b23d7555838ceaa5952c0"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::streaming::read_until_start_and_infer_schema (cyclomatic 22): polars_io::csv::read::streaming::read_until_start_and_infer_schema has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce0282a835a22512dcf594cf2d34d77dc6786d2e8c8f27f5e6cf6c9df0c1844"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::streaming::infer_schema (cyclomatic 22): polars_io::csv::read::streaming::infer_schema has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e71dae9fd5b989b6729ae6c174409447c9906b43899c63b18ad9767bd1fab6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_binview (cyclomatic 22): polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_binview has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c783024155924497511e438211faaa432e39d89ca51d9ddf88fc2e1ed9f8bce"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::rank::rank (cyclomatic 22): polars_ops::series::ops::rank::rank has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rank.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce80839f292f80ee4ee31c5995caa713819c32c22f807574faa9922be811825"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::various::is_sorted_impl (cyclomatic 22): polars_ops::series::ops::various::is_sorted_impl has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/various.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca78814bd944652120ec18f2096ea1b3ba33e53cd06767dc719584942c20aa"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_plain (cyclomatic 22): polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_plain has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec425e536ac835b708c7b2418f55a555dbab6514b0d1896ed4ffc4907e0ac7cf"}},{"ruleId":"D1","level":"warning","message":{"text":"AExpr::is_fallible_top_level (cyclomatic 22): AExpr::is_fallible_top_level has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b2eec95ca076bd25d19186c6cd889f43fe5330377f9ebf125641e28037fa3a"}},{"ruleId":"D1","level":"warning","message":{"text":"IR::exprs_mut (cyclomatic 22): IR::exprs_mut 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. This is NOT this file\u0027s highest cyclomatic complexity: IR::inputs (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"855017fef845ec55b7036c7cee509f4372019a9f5bcd65a58158f2466549a9dc"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::schema::get_struct_numeric_dtype (cyclomatic 22): polars_plan::plans::aexpr::schema::get_struct_numeric_dtype has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d6b6353f47e68891a4cf21bf5e082ac63f90251c1aa8c12ec8266f45fda36e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::join::build_upcast_node_list (cyclomatic 22): polars_plan::plans::conversion::dsl_to_ir::join::build_upcast_node_list has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"718ad8e48accbb814f6ea32173b235aac404b5c7962f293fc627c3ba047528f6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::binary::coerced_binop_dtype (cyclomatic 22): polars_plan::plans::conversion::type_coercion::binary::coerced_binop_dtype has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2daa8f11e3add6dbf63924642531fc03a55f870c0b97ba48e4bf393ff3de174"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::binary::process_binary (cyclomatic 22): polars_plan::plans::conversion::type_coercion::binary::process_binary has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7bf944b548356f01d1c8fdfca48931c774b9c2c67015aedc94f145cbf66149"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive (cyclomatic 22): polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"74deee284e550ee71210cf2c1dfede858d4924eeba5d88e4a5767b67aa538b88"}},{"ruleId":"D1","level":"warning","message":{"text":"MorselStreamReverser::run (cyclomatic 22): MorselStreamReverser::run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cf3a2e8f000b62338656f66ded8f17f79d1c67151afd010c3de585021d4603"}},{"ruleId":"D1","level":"warning","message":{"text":"SampleState::try_transition_to_build (cyclomatic 22): SampleState::try_transition_to_build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f1cd05864c9efafce211fb8c0c3be1f47bc2e2fc8b719e57010ca7f6777463"}},{"ruleId":"D1","level":"warning","message":{"text":"LanceScanResolver.resolve_lazyframe (cyclomatic 22): LanceScanResolver.resolve_lazyframe has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/lance/_scan_resolver.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2024bcf5ff6099e4af573ba4da6b1770d3f0ef53bba6da5cfa58c84d04e965"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::decimal::divrem_256_128 (cyclomatic 21): polars_compute::decimal::divrem_256_128 has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"788901e90cc38d92be40f7614b55cc1f6956c08e69e9c1b394cfdd5d1518f624"}},{"ruleId":"D1","level":"warning","message":{"text":"PolarsError::wrap_msg (cyclomatic 21): PolarsError::wrap_msg has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-error/src/lib.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2c38b2a199785dcc51661bada02de4fd8c1db3489b09a4d53f34f60e81b47c"}},{"ruleId":"D1","level":"warning","message":{"text":"GatherExpr::evaluate_on_groups_impl (cyclomatic 21): GatherExpr::evaluate_on_groups_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/gather.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b57af6c86f2f27f4f94fdb39b2f0f0379cfb3d55b709e09f5cee3169dcf8ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_logical_type (cyclomatic 21): Parser::parse_logical_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7414128a2aa9326d9c2e48599224e1bda9d1554c705d515b2d37fa7b3d51ba6f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::write::pages::to_nested_recursive (cyclomatic 21): polars_parquet::arrow::write::pages::to_nested_recursive has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f7c9c3d8378869c0456ecd0e56f76b16bc590400137769dd557104e20df27"}},{"ruleId":"D1","level":"warning","message":{"text":"IRDisplay::_format (cyclomatic 21): IRDisplay::_format has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"061fd6b6af6998606ca082ac7fecfd6242e3793d318eb65599fe8cafa6c26bda"}},{"ruleId":"D1","level":"warning","message":{"text":"IR::exprs (cyclomatic 21): IR::exprs has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: IR::inputs (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2196fe8a2646ad8eacf465a71bf24f222779299c56e30a2f12b9b40d49694bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info (cyclomatic 21): polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117cc8238d3b8b10b6b972f418f33ce56054bf1b9fe76d8eab318924319d003"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_pushthrough::candidate (cyclomatic 21): polars_plan::plans::optimizer::join_pushthrough::candidate has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefd94e8aa9b01886a2e6c379296f186ea3f43a0cf937d9fb234393ddf6b490f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_year_comparison (cyclomatic 21): polars_plan::plans::optimizer::simplify_expr::arity::simplify_year_comparison has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf0db0dbbc797203e6f69b1d958934c728937fb9c967224bb62038ae2e30a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiplexerNode::spawn (cyclomatic 21): MultiplexerNode::spawn has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/multiplexer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5d40c28cc80110f748d691f8ec1cb7cf9febe3bfd3504a48a5486fde2a9c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl (cyclomatic 21): polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2265b9df97be8f31e6d97be16129f2608274ba171ff60143cab87fbfdbc995"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::nodes::merge_sorted::find_mergeable (cyclomatic 21): polars_stream::nodes::merge_sorted::find_mergeable has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e717524ea16c9396847a3b6e31b2b2101d5b2cb626e0adfd072064ed4b5d0a50"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe.iterable_to_pydf (cyclomatic 21): dataframe.iterable_to_pydf 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a361ec8531d0a83b3368abadc7feac34fa0fe2f4f81ee6248fe0d2f1dde01682"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_parquet (cyclomatic 21): DataFrame.write_parquet 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4219}}}],"partialFingerprints":{"codehealthFindingId/v1":"67593c4e8d2e6ba249382ae68c1ce6435dc34262468e33a639578b9eaf3b01e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Series.__array_ufunc__ (cyclomatic 21): Series.__array_ufunc__ 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"403d2465fe464b2a9791ad18c42c4ae9b5cf9afc569ced13ee481445ffc736fd"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader::finish (cyclomatic 20): JsonReader::finish has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/json/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b0170074e29f57c5601caa40716827ff3bcb233f218d27e5e0f0860c45a12"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::schema_inference::infer_field_schema (cyclomatic 20): polars_io::csv::read::schema_inference::infer_field_schema has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86f43f8a13c92903fe7a5e76bc36e9006d94dd2fcffab5b9b41fac3129d468e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_json::json::infer_schema::coerce_dtype (cyclomatic 20): polars_json::json::infer_schema::coerce_dtype has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/infer_schema.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adaacfa6c723f093775068b7f1da5c8c93316b7964586b34239ac552b7eb09a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_mem_engine::executors::projection_utils::check_expand_literals (cyclomatic 20): polars_mem_engine::executors::projection_utils::check_expand_literals has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/projection_utils.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"000837b486af75f94e905efe269385dcd77a4c0b3a0696e6e3af9cde08f6a1a2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::frame::join::cross_join::fused_cross_filter (cyclomatic 20): polars_ops::frame::join::cross_join::fused_cross_filter has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/cross_join.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"739cd7bf4a72185119334616e2d292b1e4544c169749a0d551c8e9599ad9a768"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::duration::impl_duration (cyclomatic 20): polars_ops::series::ops::duration::impl_duration has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/duration.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca0c862302ab1f68243bdcc74955de52e5232facca6bb3837177e516958e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::geo::geo_key_value (cyclomatic 20): polars_parquet::arrow::geo::geo_key_value has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/geo.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc166cdd94e59d1daa45b47227c60f2451bf023bb4bbacec58db3402e230c13"}},{"ruleId":"D1","level":"warning","message":{"text":"StackOptimizer::optimize_loop (cyclomatic 20): StackOptimizer::optimize_loop has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/stack_opt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80790558b89841521ef824c9959c5c9e0e8f662fe64f5466fbdde6687831079"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::aggregate_from_statistics::aggregate_from_statistics (cyclomatic 20): polars_plan::plans::optimizer::aggregate_from_statistics::aggregate_from_statistics has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/aggregate_from_statistics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"731de2341a0a2050394e9d634645fc082a9cc75516f78b7242af7ac0e8772559"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_order::cluster::extract (cyclomatic 20): polars_plan::plans::optimizer::join_order::cluster::extract has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da782e5478a3bba8a0d22232cbdb42f9d7bce33a571c69a5a59b58ae5e5187d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_outer_equi_join (cyclomatic 20): polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_outer_equi_join has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a668fccfb3f6273abf367fcca23c495f03e1a76c42d38deb98c0fe3f326b9209"}},{"ruleId":"D1","level":"warning","message":{"text":"PySQLContext::catalog_statement (cyclomatic 20): PySQLContext::catalog_statement has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f624057e65fe3f295ca1c47ac40d90537405204e31ea2d13ad950c12851e1043"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::try_first_row_order (cyclomatic 20): SQLContext::try_first_row_order has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"25348269527bcc2616707f12d34cc5dc38537aefdf6e7bf6c43e68400bf9c8e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnSelectorBuilder::attach_iceberg_transforms (cyclomatic 20): ColumnSelectorBuilder::attach_iceberg_transforms has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a45bc5cad06100202c5d32928c8310fcacd1cb6b1c1774e7f44a06bb3c28db"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeJoinNode::update_state (cyclomatic 20): MergeJoinNode::update_state has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c287ad36c761ba8187bc30a1626535f8ee620cc60848cd0e424142f0a29e95b"}},{"ruleId":"D1","level":"warning","message":{"text":"functions.scan_csv (cyclomatic 20): functions.scan_csv 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":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b0b2ed4a69026174d6a4de1058cb6f7fd1c618ddbd16446d52491f103e2948"}},{"ruleId":"D1","level":"warning","message":{"text":"_partition_evolution._validate (cyclomatic 20): _partition_evolution._validate 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":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdd7d07b81821e8826f3e68c4791fe9738ce289b6f531617cf24b64bbcdb484"}},{"ruleId":"D1","level":"warning","message":{"text":"functions._get_sheet_names (cyclomatic 20): functions._get_sheet_names 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae99c2a29d884df4df78381df2c57cdf5a25e3db445d77975586214537323ce"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyFrame.pivot (cyclomatic 20): LazyFrame.pivot 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":8229}}}],"partialFingerprints":{"codehealthFindingId/v1":"406cd2aa6c20ea598c10922c5740c978dc1576d73d359a9f1cbf7c4da3551e33"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyFrame.update (cyclomatic 20): LazyFrame.update 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":8976}}}],"partialFingerprints":{"codehealthFindingId/v1":"52749795fb0025d632257e30997ae4211ae73537390926a035571868b431942f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::fmt::iso_duration_string (cyclomatic 19): polars_core::fmt::iso_duration_string 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. This is NOT this file\u0027s highest cyclomatic complexity: AnyValue::fmt (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb540df3901ddb14eb67cfb0ec7abbd28483943003674ef93525ba00a89d3c7f"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnPredicateExpr::new (cyclomatic 19): ColumnPredicateExpr::new has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: polars_io::predicates::cast_to_parquet_scalar (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d186e2628f1db49f504acb2fb0ec396c029ef9fe292c93520c42206a61ea4d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader (cyclomatic 19): polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::for_each_line_from_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2d52cfda76b5a41e3653bbcbd6b573801f04c9536919c559c8aad82b033a0f"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::streaming::for_each_line_from_reader (cyclomatic 19): polars_io::csv::read::streaming::for_each_line_from_reader 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24c1f8617134be51be3cc438e49fcc2efdf9459603c7220ebca14c057daa53"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeView::from (cyclomatic 19): TreeView::from has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd2a6f089116efc2f2308359669fae549916d52b21cb7912f72b194d634ed8d"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeTraversalImpl::traverse_rec (cyclomatic 19): TreeTraversalImpl::traverse_rec has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/traversal/tree_traversal.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b233b9d54b4fa904f1ab82946827021888a22b3f68fa65e7ca1d233f12ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::sinks::validate_sinks (cyclomatic 19): polars_plan::plans::conversion::dsl_to_ir::sinks::validate_sinks has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sinks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"835db1eacc919a045d99f98ecb701cde6039b3d1e9aa645210f7622e7a4dacb6"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::expand_datasets::rebuild_scan_from_expanded (cyclomatic 19): polars_plan::plans::optimizer::expand_datasets::rebuild_scan_from_expanded has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b6f16024e0a01bf901520e5eaaf3d318e70eeb02405301239a4f7489c096c"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::window_top_one::find_window (cyclomatic 19): polars_plan::plans::optimizer::window_top_one::find_window has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/window_top_one.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd842af53593f72caaab850fe7d2b8972b33a6d6ac1e92a72706e7756627551c"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_row::encode::encode_array (cyclomatic 19): polars_row::encode::encode_array has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07c2005a3f1153d426100c37ea93e3f45d5df1d188e12b9920daf9c283d186d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprVisitor::visit_like (cyclomatic 19): SQLExprVisitor::visit_like has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"673eb7f7533942cbb1368ea54e09ae9b978bad316b5cfe45ce887e426e359bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprVisitor::visit_any_subquery (cyclomatic 19): SQLExprVisitor::visit_any_subquery has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"db891d73c79d993bf9e85c01e2a813898a1599f986f7d94309e6a0f1e0318d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::catalog::hint_unsupported_part (cyclomatic 19): polars_sql::catalog::hint_unsupported_part has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"be75b9205a3c92bd6f4cc06568338360b8de75b2b16b533d206a827d8089b101"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::join_keys::sql_join_key_pair (cyclomatic 19): polars_sql::join_keys::sql_join_key_pair has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/join_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8759810f560060e956598c91e2c051262302b8e9b6ac513a18680c95bceee47d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::sql_expr::resolve_compound_identifier (cyclomatic 19): polars_sql::sql_expr::resolve_compound_identifier has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ae5a2f6d4c326c00937c649e858788e51370d10a258e3189c1542788088a2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::subquery::exists_aggregates (cyclomatic 19): polars_sql::subquery::exists_aggregates has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b09ac4d9e3a2ff06b12a9452ed4ca51d33e532d249ae821a4d1cf6cbfce6150"}},{"ruleId":"D1","level":"warning","message":{"text":"BackwardFillNode::spawn (cyclomatic 19): BackwardFillNode::spawn has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/backward_fill.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea4a7a9d7645bb0ba0839785b4bc9264b9dc37f86305fba1279a59c20a3b8ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ForwardFillNode::spawn (cyclomatic 19): ForwardFillNode::spawn has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/forward_fill.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"215d03e9674ac8ddf7a534aa69d2a44a1be3625d427f915903b343a86af5d982"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe._post_apply_columns (cyclomatic 19): dataframe._post_apply_columns 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1d86d147b3396f5dac70fcaa3eb3abbe0ccf88e30e8afb09817c14751b0f07"}},{"ruleId":"D1","level":"warning","message":{"text":"RewrittenInstructions._rewrite_functions (cyclomatic 19): RewrittenInstructions._rewrite_functions 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":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"238924fc4d11c73408868c0a8d5fcc7f0557b47bfdea893396f58e2531cac356"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergSinkState._commit (cyclomatic 19): IcebergSinkState._commit 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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ec0d8ac0b971ebd4187db8c074692d88b5cb8d08ca84ed137d0eea49696afb"}},{"ruleId":"D1","level":"warning","message":{"text":"functions._get_read_options (cyclomatic 19): functions._get_read_options 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a50a862ee5154756090a831ec32148fc764f2f421562b75e116a74f86f425bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Series._arithmetic (cyclomatic 19): Series._arithmetic has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c849c9b7f2f562cc987e97cbaef0f9a2cf18c0dd15e515916dd4e5a0df8ea67"}},{"ruleId":"D1","level":"warning","message":{"text":"context._insert_catalog_table (cyclomatic 19): context._insert_catalog_table 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b15fd10b64ff051ebc2cd1f17d797cdad4df43eb548da83da5a0f5eb9c69f1"}},{"ruleId":"D1","level":"warning","message":{"text":"context._assignable (cyclomatic 19): context._assignable has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba55572dd0868b05d54b67333a9a1627d8206d5d14b9eb17f2402da0add6faf"}},{"ruleId":"D1","level":"warning","message":{"text":"ListNumericOpHelper::try_new (cyclomatic 18): ListNumericOpHelper::try_new has cyclomatic complexity 18 (threshold 15). Of this number, 16 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7414eafe3e8c7be086db4f6fee365f4133489ec6b1762ea1929696609c6d463"}},{"ruleId":"D1","level":"warning","message":{"text":"Series::shrink_type (cyclomatic 18): Series::shrink_type has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/eager.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e151b9c27c28ffead2b1e82ce65b1c60c7ae8795dd244babdc1ac89030dd6b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_struct (cyclomatic 18): polars_core::series::any_value::any_values_to_struct has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Series::from_any_values_and_dtype_unnamed (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":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e71d7a95c6771156990b03343fba67e3c17d4eb879471649eac5af10b8aa87"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyRowHashHotGrouper::insert_keys (cyclomatic 18): KeyRowHashHotGrouper::insert_keys has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/key_rows.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"856d9141d51e963186e418d004137667f283977fe40f634b4680379e64f0799e"}},{"ruleId":"D1","level":"warning","message":{"text":"KneeController::step (cyclomatic 18): KneeController::step has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6a3316b3463ddf28d8943f7c8d87468c43756a50bbbd4c51ac3f25d6ec09e7"}},{"ruleId":"D1","level":"warning","message":{"text":"LineIndexer::index_lines (cyclomatic 18): LineIndexer::index_lines has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/field_index.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3902deeee013a8d68caa85c9a9ca42c36d2d01f7cee1f249cba104d828e79efe"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_mem_engine::executors::group_by_streaming::can_run_partitioned (cyclomatic 18): polars_mem_engine::executors::group_by_streaming::can_run_partitioned has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/group_by_streaming.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"462b2ef2eb16cad232c07142591516c0f3aa7a38f12b2174d98b83e284548b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::functions::create_scan_predicate (cyclomatic 18): polars_mem_engine::scan_predicate::functions::create_scan_predicate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fab96ffe77f550629b3d7b72d3d63c37dbabffd90750f0dbb9366658a64297"}},{"ruleId":"D1","level":"warning","message":{"text":"BooleanDecoder::extend_filtered_with_state (cyclomatic 18): BooleanDecoder::extend_filtered_with_state 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":"crates/polars-parquet/src/arrow/read/deserialize/boolean.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e0100d39e1728811fe6264819320f299c13af214d1072f1b4eedcf8cfdad3"}},{"ruleId":"D1","level":"warning","message":{"text":"CategoricalDecoder::unspecialized_predicate_decode (cyclomatic 18): CategoricalDecoder::unspecialized_predicate_decode has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/categorical.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4381d8921f6f3b9faf0816067b08d521fba27a37438b634b06b87acd2aaeac3"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::schema::convert::from_int64 (cyclomatic 18): polars_parquet::arrow::read::schema::convert::from_int64 has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: polars_parquet::arrow::read::schema::convert::from_int32 (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/schema/convert.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e6d60f3271e615ec62d914c569f1c2b954551f204599fb5d9e18d73f79cbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"ConversionOptimizer::optimize_exprs (cyclomatic 18): ConversionOptimizer::optimize_exprs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a065cd11a29697ca1993ddd568b9641e9534c4714f48dbc7bb44624e27b4142"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::filter_constraint::model_and_chain (cyclomatic 18): polars_plan::plans::aexpr::filter_constraint::model_and_chain has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceb74e7ec74d74f91bcdf6deb1458c370c59ba445504e261edfab79cb69858a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::properties::general::can_pre_agg (cyclomatic 18): polars_plan::plans::aexpr::properties::general::can_pre_agg 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":"crates/polars-plan/src/plans/aexpr/properties/general.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"810ad5f966b23f6b333c1b36b7e8439ec1ec82efbceda1fe908168f2e4708ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::sql::trunc_arith (cyclomatic 18): polars_plan::plans::conversion::dsl_to_ir::sql::trunc_arith has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e22168d2663f2d853a15d9fe8f78c99bc2f9329418ad52727e4f19b11c0f717"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_pushthrough::pushdown_candidate (cyclomatic 18): polars_plan::plans::optimizer::join_pushthrough::pushdown_candidate has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"612660968ac8aa5eff15a2ff68f10f4693451a709e305ad8761669bbf9edcd9b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::projection_pushdown::field_pruning::recompute_schema (cyclomatic 18): polars_plan::plans::optimizer::projection_pushdown::field_pruning::recompute_schema has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaead7b8723233baaeef7a52e07a2050ede39da0a251b6a289d592bdad86646"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_ternary (cyclomatic 18): polars_plan::plans::optimizer::simplify_expr::arity::simplify_ternary has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f51e97e232ad7892cc6b55b25c0824180494dc6eab8bf927eb597bb6b9c7fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::merge_plan (cyclomatic 18): SQLContext::merge_plan 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":"crates/polars-sql/src/context.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"0322a99bd59dca994d7c18556df3c5e7f870eef360235d41d6298fb5a076a6fc"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::process_asof_join (cyclomatic 18): SQLContext::process_asof_join has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c092ce9b890310fe29d0510fe8b38f7f6f94b9e7555c08d57f5a967480205c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::get_table (cyclomatic 18): SQLContext::get_table has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5852}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec657b12240b053e4fb15c81206e6cc56b9a5397ec24bbe3977f5a3f0c68027"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::process_wildcard_additional_options (cyclomatic 18): SQLContext::process_wildcard_additional_options has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6876}}}],"partialFingerprints":{"codehealthFindingId/v1":"303b1d71365bea3d4bab3467b69e71795cfcf3e474534a8096e47de63b6b211a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::rewrite_exists (cyclomatic 18): SQLContext::rewrite_exists has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a2d6dd66d0ddfa136e70ef6bc22ece2574f7bf56bab4650459d6b362632277"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLContext::outer_select_item (cyclomatic 18): SQLContext::outer_select_item has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_outer_select.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d00d828caeef482d3dfdc539ab8c4da2f42b0377bc4e0745189dbe6df40771"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::context::merge_source_columns (cyclomatic 18): polars_sql::context::merge_source_columns has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":8909}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecddb3fb1ca5d8147caa6654fb261599ffcd14913407f9f2ed97e724fe19f41"}},{"ruleId":"D1","level":"warning","message":{"text":"PhysicalPipe::spawn (cyclomatic 18): PhysicalPipe::spawn has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/pipe.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe084f30c7a899793a0b7932185208acb8ff9c28b90fed38ec36913e55a6b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::execute::run_subgraph (cyclomatic 18): polars_stream::execute::run_subgraph has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7210ac0c04e1e047b40381fe77ebf85f03d391b1661e249ff0fa396e867af20e"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupByDynamicWindower::insert (cyclomatic 18): GroupByDynamicWindower::insert has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff88dec999f6aa25a985f47f99f7efe2d4f57242a2b5bd25e0ad27fe07047e5"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.to_torch (cyclomatic 18): DataFrame.to_torch 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"256259c12d551ceea8adabfe1d8c79cdff9575871ac0a6b7be41d9f6d7330f8c"}},{"ruleId":"D1","level":"warning","message":{"text":"_partition_evolution.partition_source (cyclomatic 18): _partition_evolution.partition_source 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":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23ee9e9fafd434c2ba596b196a18145e97caea590e2a35773861c84dffcb934"}},{"ruleId":"D1","level":"warning","message":{"text":"_sink._partition_key_exprs (cyclomatic 18): _sink._partition_key_exprs 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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ddf067f38687facee8c2a93f7956bc67a653a3439b2a7b25249dce68014b63"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::horizontal_concat_list::horizontal_concat_list_unchecked (cyclomatic 17): polars_compute::horizontal_concat_list::horizontal_concat_list_unchecked has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/horizontal_concat_list/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a23cd0fa98281601d0a5ec12b61307fb24db9bebe6f6516e05a59fb24dd010"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkedArray::agg_arg_max (cyclomatic 17): ChunkedArray::agg_arg_max has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1411032ffa48433afbaf8dbbda51acb75d5cd8bee828b7d9924a66bfbedbca8"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::chunked_array::ops::search_sorted::search_sorted_slice (cyclomatic 17): polars_core::chunked_array::ops::search_sorted::search_sorted_slice has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/search_sorted.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"827ea7486a3bea3e3589104dd9569126b2a69c34d617390f3f9f6b2aa27abe99"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::frame::column::scalar::estimated_repeated_size (cyclomatic 17): polars_core::frame::column::scalar::estimated_repeated_size has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/scalar.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee23574aa5dfd035ed039cb70b0fc1a04ad03ab4bd8dd09efaf4dc3bdcbbedb"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_string::any_values_to_string_nonstrict::_write_any_value (cyclomatic 17): polars_core::series::any_value::any_values_to_string::any_values_to_string_nonstrict::_write_any_value has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Series::from_any_values_and_dtype_unnamed (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":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ca62c748ca59f71d6d40182069ed1dedddf6acecb68633ea905ea87de9d1af"}},{"ruleId":"D1","level":"warning","message":{"text":"Ramp::round (cyclomatic 17): Ramp::round has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"86372d295b6d69712f79d7e816063211b1a14806f06e39301b56aa5f01f37217"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudOptions::build_aws (cyclomatic 17): CloudOptions::build_aws has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c26664218f68e0d0b50a0d209ab696a006c2f8b123572ffe3136fc0463fd89"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudOptions::from_untyped_config (cyclomatic 17): CloudOptions::from_untyped_config has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0664e036f3e8da1a2a733ae87ef6dd048a0d5d52f9c8474c0b7124537c7b11"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_io::csv::read::schema_inference::infer_types_from_line (cyclomatic 17): polars_io::csv::read::schema_inference::infer_types_from_line has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1374be9cdd66b0de3121292806f05f2471e8f806b49b42edd03129218449053e"}},{"ruleId":"D1","level":"warning","message":{"text":"UnionExec::execute (cyclomatic 17): UnionExec::execute has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/union.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eab6626eea6ecca51a75d5a2199e159383a8fcfb35c3f954a71b6cba0ccc650"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::chunked_array::list::get::lst_get (cyclomatic 17): polars_ops::chunked_array::list::get::lst_get has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/get.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ffe6f7d7a35a6c9d20fc0c60b73505c9a7dc14c173ccaf0d7c72b505973c03"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::clip::clip_helper_both_bounds (cyclomatic 17): polars_ops::series::ops::clip::clip_helper_both_bounds has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"db482ff54ad524e67fa8d53fc4e29bf3b537d874bc9b1a9ec9944d406962380b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::series::ops::rle::rle_lengths (cyclomatic 17): polars_ops::series::ops::rle::rle_lengths has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rle.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae9502f568096906ba818a67639becadfc5a3661ea8bf1565409f1b7bcf272"}},{"ruleId":"D1","level":"warning","message":{"text":"PageDecoder::collect_flat (cyclomatic 17): PageDecoder::collect_flat has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6c12e969911649e5e44a2720979a4cc3dcf4b5d94c4f8b8943d866284eb22d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive (cyclomatic 17): polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d79b7a37ce40594cbbf5822cc7e32fc8b12c25ac40bda88dc83115f7388974"}},{"ruleId":"D1","level":"warning","message":{"text":"Selector::into_columns (cyclomatic 17): Selector::into_columns has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: DataTypeSelector::matches (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"164674a872446e5eb023a5d65d0353f36bfdc8f793fcaccd89f64fdb1990875a"}},{"ruleId":"D1","level":"warning","message":{"text":"IRStructFunction::get_field (cyclomatic 17): IRStructFunction::get_field has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac8c0d59636621d3e8d9645292bc9b4d9097620cf4d4ed494950e6f1779fc08"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::filter_constraint::classify_comparison (cyclomatic 17): polars_plan::plans::aexpr::filter_constraint::classify_comparison has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"744905e4bd12d5ede079fdca3fd59692539a5feccab5b4deeb39c3b80c0e0fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::aggregate_from_statistics::statistic_values (cyclomatic 17): polars_plan::plans::optimizer::aggregate_from_statistics::statistic_values has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/aggregate_from_statistics.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0d024716c608abfd3bd48cfd49bfb0432101ee6cbf754fe2f26071b6a9dd96"}},{"ruleId":"D1","level":"warning","message":{"text":"OuterJoinTree::covers (cyclomatic 17): OuterJoinTree::covers has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff19b1fffbd9be0775942a3c42a209cafbc2bf358c074b73a3354a719cf55820"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::catalog::partition_field (cyclomatic 17): polars_sql::catalog::partition_field has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ecc52d49179bf63b4a6669a2d4bcae93a8bb6c1e123ce54b1994cda9864232"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_sql::context::disambiguate_projection_cols (cyclomatic 17): polars_sql::context::disambiguate_projection_cols has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SQLContext::catalog_statement (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3faf737b5eaea6cc66ea27b666cb1850e9ecb3a6c2513347291d22a2d201bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyExtraOps::initialize (cyclomatic 17): ApplyExtraOps::initialize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/apply_extra_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3ce8d4785518df7da293708310278aefcc458a6ed47047c61dcf430f9ffb79"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectionBuilder::build_projection (cyclomatic 17): ProjectionBuilder::build_projection has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4583aa5cfc6e5fb113f3736bd45b4e1ee22cee0fa6ebb1d5313abbd50b98aa19"}},{"ruleId":"D1","level":"warning","message":{"text":"CrossJoinNode::spawn (cyclomatic 17): CrossJoinNode::spawn has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/cross_join.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e41ba8e338d57f631528f08c04516fc146b8ff78baf36e1f510cb109375a628"}},{"ruleId":"D1","level":"warning","message":{"text":"SortNode::partition (cyclomatic 17): SortNode::partition has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d3d9147acf842172869d27df1dd7d48fc159b5d11c963f0e43e12d135bb7e8"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::execute::execute_graph (cyclomatic 17): polars_stream::execute::execute_graph has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba17a8f99a935561ba18ee8fa07e8c8eaa38a18c8dbc1d1427c1749c2ceb8bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_time::windows::group_by::update_groups_and_bounds (cyclomatic 17): polars_time::windows::group_by::update_groups_and_bounds has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc2d71713397e9f0fbb0173d462c24ee929bd22cbdbac8e2256500899b3ea34"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe._unpack_schema (cyclomatic 17): dataframe._unpack_schema 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b313a3c9e5f7337ff399b80ef58f2737349c50a748e74e84df623d0439c9388"}},{"ruleId":"D1","level":"warning","message":{"text":"dataframe._sequence_of_sequence_to_pydf (cyclomatic 17): dataframe._sequence_of_sequence_to_pydf 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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d797d0c1cff401495208a40b5711c1d3359e6fd47e22db65d077b617e61f99a"}},{"ruleId":"D1","level":"warning","message":{"text":"getitem._convert_np_ndarray_to_indices (cyclomatic 17): getitem._convert_np_ndarray_to_indices 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":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba9ad6b96c1bed0502de087b4754daf34f27a7325eac78f914f26dab9b5b161"}},{"ruleId":"D1","level":"warning","message":{"text":"various._cast_repr_strings_with_schema (cyclomatic 17): various._cast_repr_strings_with_schema 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":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ec4e2871b6c15fc4df55083e0a2f20230d039933ff29ac95ccd70622fe79e"}},{"ruleId":"D1","level":"warning","message":{"text":"various._get_stack_locals (cyclomatic 17): various._get_stack_locals 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":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e16ede073f7da39a248ec15b73a13aee40fe3624e76a6250c9475f3b71bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.to_numpy (cyclomatic 17): DataFrame.to_numpy has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DataFrame.to_numpy) 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c42a525e7fd24f7d5f5be0893058023e8deaae8e198af5cd7274276b17d2813"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.to_numpy (cyclomatic 17): DataFrame.to_numpy has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DataFrame.to_numpy) 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f78e78b9e6176ff8ff915e8b0308e70403d68ab42ffb835aeb3a2870fc720"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_delta (cyclomatic 17): DataFrame.write_delta 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9191e6eae36cdae78afd1a748760ce190de1a311ea53211bc65ac71d07e2ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaSinkState._attach_resolved_sink (cyclomatic 17): DeltaSinkState._attach_resolved_sink 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":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"773125eeb7bd8dc45712cb2c8317ef20badaeaef61120b35dad1e5806b16dbe0"}},{"ruleId":"D1","level":"warning","message":{"text":"_sink._check_writable (cyclomatic 17): _sink._check_writable 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":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dda2fb1c34a858840aa8d7e5a60ce8cb70d3b3d393a34f5ed724f3e6e1d3f1"}},{"ruleId":"D1","level":"warning","message":{"text":"_sink._sort_key_exprs (cyclomatic 17): _sink._sort_key_exprs 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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa015972cac0391802837c10f208434d85f319140238a1523b86738f6261fe5d"}},{"ruleId":"D1","level":"warning","message":{"text":"functions._initialise_spreadsheet_parser (cyclomatic 17): functions._initialise_spreadsheet_parser 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"18254e6c9c66a53414e7beea44a124537fa9e95da91db16d3d39fb549d9980e6"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyFrame.sink_delta (cyclomatic 17): LazyFrame.sink_delta 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07f402938abe17b8579f185559cfca245172d3b8b855da31e9fae86f0b833e6"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimitiveRangedUniqueState::append (cyclomatic 16): PrimitiveRangedUniqueState::append has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/primitive.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d495464b2d34a9f5ffb1ef682cea389ccc238d59c91bf62daa7ebf53a216d723"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_compute::rolling::create_validity (cyclomatic 16): polars_compute::rolling::create_validity has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb531298b3d418c3d32c8b73ec46e761782f9681c34dd9b4374543fd3921d63"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkedArray::agg_arg_min (cyclomatic 16): ChunkedArray::agg_arg_min has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a383723a557faac2be3342789177daf37bd07eda7f55df8b121d76ed9f128"}},{"ruleId":"D1","level":"warning","message":{"text":"Column::arg_sort (cyclomatic 16): Column::arg_sort has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 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":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1072cd7cf64cbec9070179c0c1f50720494d4c40732d30e0470e88a6c2405601"}},{"ruleId":"D1","level":"warning","message":{"text":"Series::to_physical_repr (cyclomatic 16): Series::to_physical_repr has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c1f1eb07a50610758cdd7e4f1b20747b5d5fe93a433523f941f3d0e263d91a"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::chunked_array::ops::search_sorted::binary_search_ca (cyclomatic 16): polars_core::chunked_array::ops::search_sorted::binary_search_ca has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/search_sorted.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"458285a29707a03df990bdfca517cd42cdcaa529557e32a6e5e6acbad8917f84"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_core::chunked_array::ops::sort::arg_sort::arg_sort (cyclomatic 16): polars_core::chunked_array::ops::sort::arg_sort::arg_sort has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"736674fe1116fb4cdd23314c3bdce006f309e0ed8be76ead728e7b47f71eb7b0"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceExpr::evaluate_on_groups_impl (cyclomatic 16): SliceExpr::evaluate_on_groups_impl has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f969a246e150265d4bc2c40b959f6c76a7dca20fe14e2f98c6ac495ad5c5db5f"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitLines::next (cyclomatic 16): SplitLines::next has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"50875d0d88caf56ff847477f37e95f002b9fb174b585278e1f1222bf04dd6372"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::functions::initialize_scan_predicate (cyclomatic 16): polars_mem_engine::scan_predicate::functions::initialize_scan_predicate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9cf18abef19b4ae36e9c3303bf60f4fdf268efc0798cda0a1999360a3f35a4"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchesToEnd::parse (cyclomatic 16): MatchesToEnd::parse has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc2cd53176c6484df9ccf866e93ac363ab32542cb0ebe82a1c451c72611a3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"RoundSeries::round (cyclomatic 16): RoundSeries::round has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ed8bcb8a6d7d8402e0135545acb9e02d469c66f2d7642ec2b1e79537bd6804"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::chunked_array::gather::chunked::take_chunked_unchecked_binview (cyclomatic 16): polars_ops::chunked_array::gather::chunked::take_chunked_unchecked_binview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb287d043fc51e7375caea686b8300caa23aaa5c139cbafb101a15a990ce2ded"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::chunked_array::strings::concat::hor_str_concat (cyclomatic 16): polars_ops::chunked_array::strings::concat::hor_str_concat has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/concat.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aedc82e0cf59a4299036f412a8408e68f51269d1dbe196cd56afb0437b09652"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_ops::frame::join::hash_join::single_keys::build_tables (cyclomatic 16): polars_ops::frame::join::hash_join::single_keys::build_tables has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b92f480f70506082a48a09983a0f08ff883539b20850176e597175f9e50889"}},{"ruleId":"D1","level":"warning","message":{"text":"IntDecoder::evaluate_predicate (cyclomatic 16): IntDecoder::evaluate_predicate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a14bcd45df2770a4f8cebd263f3364769e8c1c48ef487dd7026cfe26dd2330"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::optional::decode (cyclomatic 16): polars_parquet::arrow::read::deserialize::dictionary_encoded::optional::decode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf75c46c1331cb491e305c3d1952ab4ebca5c310b48ecb59ef0666df3c8188dd"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionIR::schema (cyclomatic 16): FunctionIR::schema has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/schema.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db89f5e4633204133d64eaea97337fdbcf58d7c4cbfa6d3ebfe36cb55e96c04"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::aexpr::properties::general::predicate_non_null_column_outputs (cyclomatic 16): polars_plan::plans::aexpr::properties::general::predicate_non_null_column_outputs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/properties/general.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cb64b92faa0950b5eb9583e8a5a501cc0f0b1d6de34373ea522567b2e1a79c"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::expand_datasets::expand_datasets_early (cyclomatic 16): polars_plan::plans::optimizer::expand_datasets::expand_datasets_early has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f86e734e736110b90f97ce66effd8777f931cac0ba63f163ce61a202ebcd104"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::try_reduce_redundant_join_keys (cyclomatic 16): polars_plan::plans::optimizer::predicate_pushdown::join::try_reduce_redundant_join_keys has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaae96e60a1bf602422d4e30525672de2cac4f9d5e6c5bf54af76efbe7bf60b"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_python::io::delta_stats::has_min_max (cyclomatic 16): polars_python::io::delta_stats::has_min_max has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: polars_python::io::delta_stats::bound (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/io/delta_stats.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fb1b842cbc98ed3a8d6a70ba96b1febb165deaea128651471f786531278d36"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBatchDataFetcher::run (cyclomatic 16): RecordBatchDataFetcher::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848b71d944352106b7bda9bbe7ab7a676ed9afcafd4329114d7573cf4327ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeletionFilesProvider::spawn_row_deletions_init (cyclomatic 16): DeletionFilesProvider::spawn_row_deletions_init has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f724dbe3c062b8fc6dda9dfc935c34d7c84d26aed2a6199a18348f8aa63c2800"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetReadImpl::init_row_group_decoder (cyclomatic 16): ParquetReadImpl::init_row_group_decoder has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f51f0c8941ddbb07291efbc310543481336c08aa08d77cd5b69d5b900eb9e6"}},{"ruleId":"D1","level":"warning","message":{"text":"FlushState::new (cyclomatic 16): FlushState::new has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/flush.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fe55cef7ccd6df99ad95782293669e2e76749735390916f0a65b33c43b04b4"}},{"ruleId":"D1","level":"warning","message":{"text":"RleNode::spawn (cyclomatic 16): RleNode::spawn has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/rle.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92d21438cba6cfab1918398798fd69c3ec195bd23bc6e53dadfb70bdca8444d"}},{"ruleId":"D1","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice (cyclomatic 16): polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaebaec712623a2bbd016ed0c178465019a38965a9c28cf26374ebb0273b05d"}},{"ruleId":"D1","level":"warning","message":{"text":"Wrap::impl_group_by_dynamic (cyclomatic 16): Wrap::impl_group_by_dynamic has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/group_by/dynamic.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0008361f0e847b886be520dc6e7332483f766e18be347f30a98571d61c3bc575"}},{"ruleId":"D1","level":"warning","message":{"text":"general._from_series_repr (cyclomatic 16): general._from_series_repr 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":"py-polars/src/polars/convert/general.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e967e7fee08b1c28e184795b467ab97f02be46128055f4e659c70df4d37353a"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionExecutor._from_arrow (cyclomatic 16): ConnectionExecutor._from_arrow 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":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf696f96d7e0d85954b3da0fcbbf92d1f3bf7b5b520612ed34fddf720d37d1"}},{"ruleId":"D1","level":"warning","message":{"text":"_sink._delta_dtype (cyclomatic 16): _sink._delta_dtype 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":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"111df8d6d9606f972038923af5690f1616f122716ec714868038994f3cbe316d"}},{"ruleId":"D1","level":"warning","message":{"text":"LanceFragmentReader.collect_batches (cyclomatic 16): LanceFragmentReader.collect_batches 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":"py-polars/src/polars/io/lance/_reader.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa8b40d9a78210bf4479950892676cc4af9467548158a0cbf64225b3ffa6083"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionPushdownVisitor::pushdown (cognitive 525): ProjectionPushdownVisitor::pushdown has cognitive complexity 525 (threshold 15). Drivers by points: if/else 163 (353 pts), loops 32 (84 pts), match/switch 16 (47 pts), boolean chains 41 (nesting depth added 273). Of this number, 518 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ceb0f84e214efe610b7965077339db0864d305c2d9382aacc3155c7589e28"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowExpr::evaluate_on_groups_impl (cognitive 273): WindowExpr::evaluate_on_groups_impl has cognitive complexity 273 (threshold 15). Drivers by points: if/else 67 (166 pts), loops 24 (83 pts), match/switch 6 (18 pts), boolean chains 6 (nesting depth added 170). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10cfa5af706ee568455ef266f02efa267d386bf2dbf44afefa21bedad22d48c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_ir::lower_ir_inner (cognitive 262): polars_stream::physical_plan::lower_ir::lower_ir_inner has cognitive complexity 262 (threshold 15). Drivers by points: if/else 78 (170 pts), match/switch 18 (47 pts), loops 8 (24 pts), boolean chains 21 (nesting depth added 137). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7790a21e941c8920e2ea6421415570a2a9af9726b51f3af4b84c5656809ca0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::to_alp_impl (cognitive 240): polars_plan::plans::conversion::dsl_to_ir::to_alp_impl has cognitive complexity 240 (threshold 15). Drivers by points: if/else 58 (139 pts), match/switch 16 (45 pts), loops 14 (38 pts), boolean chains 18 (nesting depth added 134). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa0398fa48d3b551978945bf0adf7f19db9355ad1d84e92540b51288df69718"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCoercionRule::optimize_expr (cognitive 195): TypeCoercionRule::optimize_expr has cognitive complexity 195 (threshold 15). Drivers by points: if/else 47 (105 pts), match/switch 23 (55 pts), loops 8 (21 pts), boolean chains 14 (nesting depth added 103). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd388e47c6e6416836bb9c3cffcd747dbf81fd86b4bea8960a7c8a6d670bf190"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergScanResolver._to_dataset_scan_impl (cognitive 177): IcebergScanResolver._to_dataset_scan_impl has cognitive complexity 177 (threshold 15). Drivers by points: if/else 47 (119 pts), ternaries 13 (21 pts), boolean chains 19, error handling 3 (7 pts), loops 2 (6 pts), match/switch 1 (5 pts) (nesting depth added 92). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd31f44728384fb9ba6310f2104038e5c4490daaa44f8ee862d39c4a791f13fb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type (cognitive 174): polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type has cognitive complexity 174 (threshold 15). Drivers by points: if/else 54 (117 pts), match/switch 9 (25 pts), loops 8 (22 pts), boolean chains 10 (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c4ff54ed15fbbac43a1cfd38f155202cc81c4093399fde6ca80407087d9d9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::cse::cache_states::set_cache_states (cognitive 166): polars_plan::plans::optimizer::cse::cache_states::set_cache_states has cognitive complexity 166 (threshold 15). Drivers by points: if/else 26 (91 pts), loops 13 (50 pts), match/switch 5 (21 pts), boolean chains 4 (nesting depth added 118). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/cache_states.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba08a406a488539c4814b9332435304b20e2954e09ac87baa33fa587c71240"}},{"ruleId":"D2","level":"warning","message":{"text":"SimplifyIRNodeOrder::simplify_ir_node_orders (cognitive 162): SimplifyIRNodeOrder::simplify_ir_node_orders has cognitive complexity 162 (threshold 15). Drivers by points: if/else 44 (91 pts), boolean chains 46, match/switch 7 (14 pts), loops 4 (11 pts) (nesting depth added 61). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb6d1182475c10c76569d9856186c72caedc779855a6548814931ca4c7c9c93"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLFunctionVisitor::visit_function (cognitive 158): SQLFunctionVisitor::visit_function has cognitive complexity 158 (threshold 15). Drivers by points: match/switch 38 (81 pts), if/else 39 (72 pts), boolean chains 5 (nesting depth added 76). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e123dffadaf3c5e78cf72136f0021a2d437e5e9e26e3ee4033015025f0fc37"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions (cognitive 154): polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions has cognitive complexity 154 (threshold 15). Drivers by points: match/switch 32 (68 pts), if/else 28 (65 pts), loops 6 (19 pts), boolean chains 2 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b17a901d5697d355fecde945c39fdfaa5c179960517ca333d28c8517ddf1066"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec (cognitive 141): polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec has cognitive complexity 141 (threshold 15). Drivers by points: if/else 32 (96 pts), match/switch 11 (34 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3ce6f7e3a75effeffc887dde12fbc08b5c6992bd3e0e2c7a11cc06b8b7d4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::to_graph::to_graph_rec (cognitive 135): polars_stream::physical_plan::to_graph::to_graph_rec has cognitive complexity 135 (threshold 15). Drivers by points: if/else 31 (75 pts), loops 12 (35 pts), match/switch 9 (21 pts), boolean chains 4 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cba698808109fc589dfa3973149f77136f620978d535969de47d2177a8cbb1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::fmt::visualize_plan_rec (cognitive 127): polars_stream::physical_plan::fmt::visualize_plan_rec has cognitive complexity 127 (threshold 15). Drivers by points: if/else 49 (91 pts), loops 8 (18 pts), match/switch 9 (18 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55c3cc7ae8b3368573de1b450fa77a389dadde61fb89c6ed67921c417513d35"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnSelectorBuilder::attach_transforms (cognitive 126): ColumnSelectorBuilder::attach_transforms has cognitive complexity 126 (threshold 15). Drivers by points: if/else 51 (92 pts), match/switch 8 (20 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ae943c67483d21200b8badaeb6f1ca80722616fbfa07d75b75e9a8ba8cf1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx (cognitive 123): polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx has cognitive complexity 123 (threshold 15). Drivers by points: if/else 30 (70 pts), match/switch 12 (35 pts), loops 5 (15 pts), boolean chains 3 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"081ed33274dfa509ac59c1fe7c0df34b8cab2722cb89eec43d52e5195ce2b2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeSortedNode::spawn (cognitive 122): MergeSortedNode::spawn has cognitive complexity 122 (threshold 15). Drivers by points: if/else 29 (92 pts), loops 8 (20 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 77). Of this number, 120 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":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"450f50c5b9a60505a1dbfed5495be3275ce8ae990f236182f6f300421bac7d91"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprOrderSimplifier::rec (cognitive 121): ExprOrderSimplifier::rec has cognitive complexity 121 (threshold 15). Drivers by points: if/else 50 (97 pts), match/switch 5 (9 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0fa9b4ecffdfb281bfabc6b1f10caa9a1fa9776b456ccf54984afb3305972c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::lazyframe::visitor::expr_nodes::into_py (cognitive 115): polars_python::lazyframe::visitor::expr_nodes::into_py has cognitive complexity 115 (threshold 15). Drivers by points: match/switch 38 (115 pts) (nesting depth added 77). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"8131422280b8cd168324e9c7471df0bc934c9e907c422f4524908ca31cacc5af"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::path_utils::expand_paths_hive (cognitive 114): polars_io::path_utils::expand_paths_hive has cognitive complexity 114 (threshold 15). Drivers by points: if/else 29 (77 pts), loops 7 (25 pts), boolean chains 7, match/switch 1 (5 pts) (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/path_utils/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41c2376f8d901edecc57d6e4bf511ff797b3c1fe27115a8fabebc72c7e6c7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::execute_select_block (cognitive 114): SQLContext::execute_select_block has cognitive complexity 114 (threshold 15). Drivers by points: if/else 44 (79 pts), match/switch 8 (16 pts), loops 8 (12 pts), boolean chains 7 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47409ad957ba809c88734a2f66494ea558bcfeecf840d69800c00e07049e34e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::_visit_nodes_impl (cognitive 113): polars_stream::physical_plan::_visit_nodes_impl has cognitive complexity 113 (threshold 15). Drivers by points: if/else 33 (101 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a3afb9aa1a8dce35c47a2ad7e7995ba415dce412b7b0f64942323c0986079c"}},{"ruleId":"D2","level":"warning","message":{"text":"CastColumnsPolicy::should_cast_column (cognitive 106): CastColumnsPolicy::should_cast_column has cognitive complexity 106 (threshold 15). Drivers by points: if/else 46 (80 pts), match/switch 5 (15 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"701cb8357bc052227ed00233c290a897672a8525c837aa360499007855845911"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderStarter::run (cognitive 106): ReaderStarter::run has cognitive complexity 106 (threshold 15). Drivers by points: if/else 37 (92 pts), match/switch 4 (8 pts), boolean chains 5, loops 1 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"629b5ffd146d1911d1eb2d9f23e1c927a923e5013b1e06332f90a0667f18338d"}},{"ruleId":"D2","level":"warning","message":{"text":"IRFunctionExpr::get_field (cognitive 105): IRFunctionExpr::get_field has cognitive complexity 105 (threshold 15). Drivers by points: match/switch 28 (56 pts), if/else 17 (32 pts), boolean chains 15, loops 1 (2 pts) (nesting depth added 44). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33b469109fdf2ae153e17857855951730087e25196a21582ccefbc0cb45645"}},{"ruleId":"D2","level":"warning","message":{"text":"series.sequence_to_pyseries (cognitive 104): series.sequence_to_pyseries has cognitive complexity 104 (threshold 15). Drivers by points: if/else 37 (64 pts), boolean chains 22, ternaries 5 (13 pts), error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/series.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b99e3d6134e64db8dcc9c27f400e2bc308dc23bf47e59e41787900a6a7e8dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_group_by (cognitive 103): SQLContext::process_group_by has cognitive complexity 103 (threshold 15). Drivers by points: if/else 50 (77 pts), boolean chains 9, loops 7 (9 pts), match/switch 7 (8 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fefebd9e207c9db10018738252e64a8b5135baa64eafd3f6b7ac39c57e8435d"}},{"ruleId":"D2","level":"warning","message":{"text":"SlicePushDown::pushdown (cognitive 99): SlicePushDown::pushdown has cognitive complexity 99 (threshold 15). Drivers by points: if/else 44 (79 pts), boolean chains 9, match/switch 5 (7 pts), loops 3 (4 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"530af20843eff8e6a198af68a034ed8608e004818e1eec1dfd2006e2739a4812"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame::to_ndarray (cognitive 93): DataFrame::to_ndarray has cognitive complexity 93 (threshold 15). Drivers by points: loops 13 (64 pts), if/else 10 (26 pts), match/switch 3 (nesting depth added 67). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ndarray.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"392719a525e240186afcbeefe6fcbc831470f96ba722aff9b2e9a3453773b4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Duration::_parse (cognitive 92): Duration::_parse has cognitive complexity 92 (threshold 15). Drivers by points: if/else 34 (62 pts), loops 6 (13 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4364748c04c5364979a723eee7ab40f8089de0c5f715a775511fdca5e00ab152"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionTranslator._expr (cognitive 91): InstructionTranslator._expr has cognitive complexity 91 (threshold 15). Drivers by points: if/else 18 (58 pts), ternaries 6 (27 pts), boolean chains 6 (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a44ab8e21a686e66432073de543bcb6fb2740b5bfa54f9e739891a1eb550416"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::process_join (cognitive 90): polars_plan::plans::optimizer::predicate_pushdown::join::process_join has cognitive complexity 90 (threshold 15). Drivers by points: if/else 26 (49 pts), match/switch 13 (21 pts), boolean chains 13, loops 5 (7 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8996af82aeabbb0c77c45a2f30043700195c266f710e64eb5ca873fa53cd1e07"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcFileReader::begin_read (cognitive 89): IpcFileReader::begin_read has cognitive complexity 89 (threshold 15). Drivers by points: if/else 35 (61 pts), loops 9 (17 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4ce8a1d992b4d249a0ea98b27b9efa88b6a22ccf255a4e031179044b90613e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbePartitions::partition_and_probe (cognitive 87): ProbePartitions::partition_and_probe has cognitive complexity 87 (threshold 15). Drivers by points: if/else 20 (66 pts), loops 6 (19 pts), boolean chains 2 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae9a1b285b3add4277132caadcb86ab1a5bc22b51abd2772482b951cebcf9c2"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkState::spawn (cognitive 86): SinkState::spawn has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (62 pts), loops 6 (19 pts), boolean chains 5 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/sink.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0715cfc66562a05b398006ae3325517b6b9b08ba5cf52f94686ff7508609b6"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::is_sorted_rec (cognitive 84): polars_plan::plans::optimizer::sortedness::is_sorted_rec has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 13 (28 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"940cadc4b8b05a9506b3291c356c85a4cccec13d198a02426c9044498e58c667"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionWalker::walk_rec (cognitive 83): SelectionWalker::walk_rec has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (51 pts), match/switch 10 (20 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb260a3c567688e47bdb46e836ae90d9649bc8dbc415b29c620aec4502592a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"_write_utils._xl_setup_table_columns (cognitive 80): _write_utils._xl_setup_table_columns has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (36 pts), ternaries 14 (30 pts), boolean chains 7, loops 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa346a397d1af33b77a98b585e740ce841380b03936c05c0acd5367d7521925"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::subquery_pull_up::try_move (cognitive 79): polars_sql::subquery_pull_up::try_move has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (44 pts), boolean chains 15, match/switch 9 (14 pts), loops 3 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e352672aa4bc466e0fd77efd63daaa3b7375879114afe70297e74e0bfd13481"}},{"ruleId":"D2","level":"warning","message":{"text":"PredicatePushDown::push_down (cognitive 76): PredicatePushDown::push_down has cognitive complexity 76 (threshold 15). Drivers by points: if/else 27 (52 pts), match/switch 6 (13 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"33850591cb4799e17c5722d64ae7e2fceea5e831e900895d10641a656231747f"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility (cognitive 75): polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (52 pts), loops 7 (13 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf48e4f25e45b1892ce1f4469aaff62749113cbf169a7f740fc070fd3a8e6336"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_database (cognitive 75): DataFrame.write_database has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (42 pts), ternaries 8 (18 pts), boolean chains 9, error handling 2 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b0cb282d6aa7051e1ac2ffa3268ddbd1cb520e9d157964ecd6b9eb44971e52"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_binview (cognitive 74): polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_binview has cognitive complexity 74 (threshold 15). Drivers by points: if/else 26 (55 pts), loops 6 (18 pts), boolean chains 1 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a89a1b717b2377937877283fa42775ac860bbc8a70ab7f6398941f4df7e47"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::parser::parse_lines (cognitive 73): polars_io::csv::read::parser::parse_lines has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 6 (12 pts), match/switch 2 (8 pts), boolean chains 4 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7757ebd3180ac1574f74371f3e5785101b35523425ccb52463dad6f0f1b93"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::join::resolve_join (cognitive 72): polars_plan::plans::conversion::dsl_to_ir::join::resolve_join has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (45 pts), loops 6 (13 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5010f9ee88cc466e9b40182be88178da90435743877ff4b3008bd40ab3c598d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetReadImpl::init_morsel_distributor (cognitive 71): ParquetReadImpl::init_morsel_distributor has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (41 pts), loops 11 (21 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bd93f94c2908c98eca06afb34374d6d8729b2828c0566c40cfdbf4ddeae685"}},{"ruleId":"D2","level":"warning","message":{"text":"_inference.dtype_from_database_typename (cognitive 71): _inference.dtype_from_database_typename has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 22, ternaries 7 (17 pts), loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_inference.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"739a7207cca540197a8817168da787072b822c13025a0d74b1d633f9411bfca4"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryExpr::evaluate_on_groups_impl (cognitive 70): TernaryExpr::evaluate_on_groups_impl has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 6 (14 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1b9d246bc99150b506d51839d80e897169af7b7252ef56bc72458d6b1a5853"}},{"ruleId":"D2","level":"warning","message":{"text":"SimplifyExprRule::optimize_expr (cognitive 70): SimplifyExprRule::optimize_expr has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 13 (39 pts), if/else 16 (29 pts), boolean chains 2 (nesting depth added 39). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32906eb99f30c682fcb6ec2462472bebaa6c614ac1ce33a768f4ab84f7c76ac"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions (cognitive 70): polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 17 (44 pts), if/else 12 (23 pts), loops 1 (3 pts) (nesting depth added 40). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"08738a4125caa631027897196a252f0ddcb0a9935f0e9a38f0e54aa137e6573a"}},{"ruleId":"D2","level":"warning","message":{"text":"IR::is_ir_equal_shallow (cognitive 68): IR::is_ir_equal_shallow has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 13, match/switch 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/equality.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf7c8f565b94aaaccb8463dda807a10735a6f79da147f9f469c262f433c6b29"}},{"ruleId":"D2","level":"warning","message":{"text":"SemiAntiJoinNode::update_state (cognitive 67): SemiAntiJoinNode::update_state has cognitive complexity 67 (threshold 15). Drivers by points: if/else 31 (59 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"63453f2edc194be2771c6683d8ec636560bbf33dcf34db4263f0b28528f1a494"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitFields::next (cognitive 66): SplitFields::next has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/splitfields.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f78e04c0747c6add8560209125f6db707d6e8ea111a6818d1fae0ea473c397"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner (cognitive 66): polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner has cognitive complexity 66 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 9 (24 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d80a83f0b16cb37f1e2ac5231185d66333a4cbe81926fd58c7272bf3953b2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers (cognitive 65): polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (60 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b963743d7b30b7de2b7d1d96b4804cbecc71317190d912ee08d9a823329e81d2"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info (cognitive 64): polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (33 pts), match/switch 7 (17 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0351ff851ac1ce18bc39a4bd8c780fa38707a9754f9a6de877bf8238d8604ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::optimize (cognitive 64): polars_plan::plans::optimizer::optimize has cognitive complexity 64 (threshold 15). Drivers by points: if/else 34 (47 pts), boolean chains 9, match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca3a073b7054898169cf4334b57f1e10569f72a3a066f5a3a3b2ba312d821d2"}},{"ruleId":"D2","level":"warning","message":{"text":"CrossJoinNode::spawn (cognitive 64): CrossJoinNode::spawn has cognitive complexity 64 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 6 (25 pts), match/switch 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/cross_join.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2607861b18086c63ad5f011a6aaef0ed6d1ad0a7ae0bddd46cfe1709017928"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::group_by_in_derived_table (cognitive 63): SQLContext::group_by_in_derived_table has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 11, loops 5 (6 pts), match/switch 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_group_by.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b8eab955f113c1deef8205bfb2e5fe239e81409792dc2c598575437018746"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprIRDisplay::fmt (cognitive 62): ExprIRDisplay::fmt has cognitive complexity 62 (threshold 15). Drivers by points: if/else 31 (54 pts), match/switch 5 (8 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5548958ba5f27a31ed19fb5bd187214c975ec574a748ac80d889c16cddf096"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::cluster_with_columns::optimize (cognitive 62): polars_plan::plans::optimizer::cluster_with_columns::optimize has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 6 (12 pts), boolean chains 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cluster_with_columns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4563da761b55cba40750b0eb8f8333f5d2725a80232af1bf8e8627fee0024d88"}},{"ruleId":"D2","level":"warning","message":{"text":"PageDecoder::collect_predicate_flat (cognitive 61): PageDecoder::collect_predicate_flat has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef97a7fb0287240b27186ba79c3719b84b7899458802b7c2152b41ec44e5c783"}},{"ruleId":"D2","level":"warning","message":{"text":"StackOptimizer::optimize_loop (cognitive 61): StackOptimizer::optimize_loop has cognitive complexity 61 (threshold 15). Drivers by points: loops 11 (38 pts), if/else 4 (13 pts), match/switch 2 (8 pts), boolean chains 2 (nesting depth added 42). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/stack_opt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"738ae9a44180b3b617529dd0ace74b335b4b6957f96458abfe7a0cb706bc20ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Shared::run (cognitive 61): Shared::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (47 pts), match/switch 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/flush.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ce081a20644e0edd587b49ff39a9382bcebe555f9034e5a8418121172d180"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._read_spreadsheet_calamine (cognitive 61): functions._read_spreadsheet_calamine has cognitive complexity 61 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 7, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eab435ffdec6b4ad9e089ca44a77ebd6e250b8ec6104ea04f4ac3f29e818aa"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame::fmt (cognitive 59): DataFrame::fmt has cognitive complexity 59 (threshold 15). Drivers by points: if/else 26 (36 pts), loops 7 (14 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22393acf0b4319902663e5b72e01a454de85f66dd9329f704d1a43f43e9598"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyExpr::evaluate_on_groups_impl (cognitive 58): ApplyExpr::evaluate_on_groups_impl has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 15, match/switch 2 (6 pts), loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d2701c299837ca159e8c3d34353a9043b6a8c266fed9d50bcf456a638be7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::infer_schema (cognitive 58): polars_io::csv::read::streaming::infer_schema has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (50 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d63ccd1420799c370e64226efca4ef805d08fe8088a57861079dddbc04d013"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::fmt (cognitive 58): Expr::fmt has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 9 (16 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/format.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee6657740392053f282724ed58339a97b0477c17d4ca208f5e784dd5ed3031b"}},{"ruleId":"D2","level":"warning","message":{"text":"NDJsonFileReader::begin_read (cognitive 58): NDJsonFileReader::begin_read has cognitive complexity 58 (threshold 15). Drivers by points: if/else 36 (46 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e4220f2865cbb2fe98c605eb8c4d68750adbe8a861bdf34992cc4edcc9ce2b"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._read_spreadsheet_openpyxl (cognitive 58): functions._read_spreadsheet_openpyxl has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 4 (10 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e621f3736a9bf9e14fd2281d62103023665ebb313278123f0152ce5dfa86d84"}},{"ruleId":"D2","level":"warning","message":{"text":"EquiJoinNode::update_state (cognitive 57): EquiJoinNode::update_state has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1335f22a41d020f4e35e49c1c95e203f145e29538a2d6a3d4f849873b2ae824"}},{"ruleId":"D2","level":"warning","message":{"text":"AExpr::to_field_impl_inner (cognitive 56): AExpr::to_field_impl_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 9 (20 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ea08f6c33786c60bb0387f506eae191bac43643049369244880e1cd88edd7f"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::hive::hive_partitions_from_paths (cognitive 56): polars_plan::plans::hive::hive_partitions_from_paths has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 6 (15 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/hive.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"749badd99f80d78ec72deb5355c3a16204a450c513251d2ad09a0bedad501f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive (cognitive 56): polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 4 (11 pts), boolean chains 3, match/switch 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"26567382dcca1786c2d74bbc1865cbde680c0d5fc2ec309e46fabf704b567846"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiplexerNode::spawn (cognitive 56): MultiplexerNode::spawn has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 6 (17 pts), match/switch 2 (9 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/multiplexer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66ab109a1e190f00ac0a9fd0caf3bc71b2d19c440fb11e511022bcc8664040"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrameJoinOps::_join_impl (cognitive 55): DataFrameJoinOps::_join_impl has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (42 pts), boolean chains 6, match/switch 3 (6 pts), loops 1 (nesting depth added 15). Of this number, 52 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":"crates/polars-ops/src/frame/join/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3db29a9a69b3debef86d3324c9a75bf2f0694331df14d4d1515a4ddfd21af24"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::ir::format::write_ir_non_recursive (cognitive 54): polars_plan::plans::ir::format::write_ir_non_recursive has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (48 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"6333b2aa31a08f5c1e8155834c3ba7a92df2ea72274f4cf0cb3735004fbe7ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipNode::spawn (cognitive 54): ZipNode::spawn has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 10 (19 pts), match/switch 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/zip.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca45f92ed626e4db276765dfbd731fc16cbb66a23160043f3bf857ab59480a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::search_sorted::binary_search_ca (cognitive 53): polars_core::chunked_array::ops::search_sorted::binary_search_ca has cognitive complexity 53 (threshold 15). Drivers by points: if/else 28 (52 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/search_sorted.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4fb7acbe04715b201c8858e209c40e1e4238675c60f6606f28b668ef8b8a22"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreReader::parse_csv (cognitive 53): CoreReader::parse_csv has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 6, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c3743fe7bdce6c9b904c49ddb6adc8b39109e00cd3e867dc1f4abfc8b6494"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::utils::unspecialized_decode (cognitive 53): polars_parquet::arrow::read::deserialize::utils::unspecialized_decode has cognitive complexity 53 (threshold 15). Drivers by points: loops 13 (33 pts), if/else 7 (14 pts), match/switch 4 (6 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"786b42546cbc2f825f1de7f0211e6b8360fea34c9c6a7917b89e82678d032ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline (cognitive 53): polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline has cognitive complexity 53 (threshold 15). Drivers by points: if/else 36 (44 pts), boolean chains 7, match/switch 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0809578749321e9d42ff590d0b9c2624a1767aed01e136ff7f6f819eae5e31c5"}},{"ruleId":"D2","level":"warning","message":{"text":"general._from_dataframe_repr (cognitive 53): general._from_dataframe_repr has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 10, loops 5 (7 pts), ternaries 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/convert/general.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9915ae0fe184202e6633c74201870987d798a55e18aad0eba08d372e1a6381fb"}},{"ruleId":"D2","level":"warning","message":{"text":"lit.lit (cognitive 53): lit.lit has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 11, ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lit.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f62571c2599ea9ebcb64823e0955cfd4151dfab374110e844d732b8d5c3687"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::split::split_to_struct (cognitive 52): polars_ops::chunked_array::strings::split::split_to_struct has cognitive complexity 52 (threshold 15). Drivers by points: loops 7 (29 pts), if/else 8 (13 pts), match/switch 3 (10 pts) (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6770b122d6955da1a3ba2a8864951d593884435b832c835e723699d9fa16bcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats (cognitive 52): polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 5 (12 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"30151b163ddcb92f275f8334eed333765e91c65f6e039eff6bc52f4795c7b70d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top (cognitive 52): polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (39 pts), match/switch 4 (7 pts), boolean chains 4, loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d64242b16169e4c92f8bd2a013374fdc48e4331a72b32a936d2ec3df4af16"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::context::disambiguate_projection_cols (cognitive 52): polars_sql::context::disambiguate_projection_cols has cognitive complexity 52 (threshold 15). Drivers by points: if/else 6 (29 pts), loops 5 (11 pts), match/switch 3 (11 pts), boolean chains 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0242eecd1f32416895064c9dd62b1c956b42b422a14ac0dcec0c9db7c70d4acc"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionDistributor::run (cognitive 52): PartitionDistributor::run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9e872cecfbb96bb518c390cce01102e53f604cf499c77ad0db5a376030a06"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_runtime_filter::scan_origins (cognitive 51): polars_plan::plans::optimizer::join_runtime_filter::scan_origins has cognitive complexity 51 (threshold 15). Drivers by points: if/else 7 (28 pts), match/switch 4 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3626c54abbf494ad37585d4ae8096d095393474b9151496d834c4add23422b56"}},{"ruleId":"D2","level":"warning","message":{"text":"RewrittenInstructions._rewrite_functions (cognitive 51): RewrittenInstructions._rewrite_functions has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (28 pts), ternaries 5 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f2933df65a9e7965b4c2682d8fbbc03886684de29220f44cb4676253aa527d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::utils::supertype::get_supertype_with_options::inner (cognitive 50): polars_core::utils::supertype::get_supertype_with_options::inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 6 (13 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"082a108270224170cf711a2bf67f67274cb2b96d7db4865394eaa2c65807d0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::list::get::lst_get (cognitive 50): polars_ops::chunked_array::list::get::lst_get has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (41 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/get.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2737827467f84d5c3c0f263571d8f2ba1f9f6e493fa9df870a78b2b373ae01a5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::optional::decode (cognitive 50): polars_parquet::arrow::read::deserialize::dictionary_encoded::optional::decode has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 3 (10 pts), match/switch 1 (3 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1756b9a8beb3af9f71cc360a6a4ba70462cbc8d5627fffd0cdf957be3bb90"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::window_top_one::find_window (cognitive 50): polars_plan::plans::optimizer::window_top_one::find_window has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (17 pts), match/switch 4 (13 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/window_top_one.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93da41334949131ce2201877d9679c6cc39c2e22bd5f21187b98f951dc97de7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::python::pyarrow::to_pa (cognitive 49): polars_plan::plans::python::pyarrow::to_pa has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 7 (15 pts), boolean chains 2 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f1f15113d8656e832d5e7c83a40399444357aee5273a38702735a6c30c5aaf"}},{"ruleId":"D2","level":"warning","message":{"text":"RowGroupDecoder::row_group_data_to_df_prefiltered (cognitive 49): RowGroupDecoder::row_group_data_to_df_prefiltered has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 6 (15 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8965cd139c926c8e2fcd1f0569704102efb6639dfc49dda9d75728edd967d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaSinkState._commit (cognitive 49): DeltaSinkState._commit has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 9, error handling 3 (5 pts), ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a6ced5b2069de8545c76784444482b5a4a73fff01b23a1870b280c58c1544f"}},{"ruleId":"D2","level":"warning","message":{"text":"_partition_evolution.spec_change (cognitive 49): _partition_evolution.spec_change has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 9 (12 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3518f074aefdbadcfbed85782806fc49568fd31e779ff4d185341115557a8a47"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::rolling_map (cognitive 48): ChunkedArray::rolling_map has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 1 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/rolling_window.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001504bdd839dfe19327f773165cc02aa2bebeb207d5fa89015a1a55d85a28d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::cross_join::fused_cross_filter (cognitive 48): polars_ops::frame::join::cross_join::fused_cross_filter has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 5 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/cross_join.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c41203c3bc453cc62bb4c2dec265cc42866b8f918fabb5e345f2a549d0d181"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges (cognitive 48): polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (36 pts), loops 7 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f600ba7d4fea66bd19925e0bb202a4bfdc00253ed88171b2294717b1293381"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe._expand_dict_values (cognitive 48): dataframe._expand_dict_values has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (9 pts), ternaries 2 (9 pts), boolean chains 8 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcdd27344a13fd001567141ef372318e97f3c0c90383b85a737014897645070"}},{"ruleId":"D2","level":"warning","message":{"text":"DtypeVisitor::visit_rec (cognitive 47): DtypeVisitor::visit_rec has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 6 (11 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"89992c24a267fe95b2db50aca39bde90c15989e1e06cd8489f51bf17ac8c4479"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::write::write_impl::serializer::serializer_for (cognitive 47): polars_io::csv::write::write_impl::serializer::serializer_for has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 10 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"334cd53c43301902835f3631f9f9f184f4b05afd7b074404b8be52e1348e7a65"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::io::iceberg_plugin::v1::convert::import_output (cognitive 47): polars_python::io::iceberg_plugin::v1::convert::import_output has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 7 (15 pts), match/switch 2 (6 pts), boolean chains 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":"crates/polars-python/src/io/iceberg_plugin/v1/convert.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f08929c2e6f3ef193ad88a0729434d62a50ac6d894a7fa7b750caa276d0fc92"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.read_csv (cognitive 47): functions.read_csv has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 9, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ed6d1b13dd9f53ef2ae4c4979eccd375662c7adf939e6811ef2413d303723"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::gather::chunked::take_chunked_unchecked_binview (cognitive 46): polars_ops::chunked_array::gather::chunked::take_chunked_unchecked_binview has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 6 (18 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f073fa287076aa8a2f27581f95e17c153082b3768847221a5ba2831bef7e53"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView::from (cognitive 46): TreeView::from has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 7 (14 pts), boolean chains 5 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"238f1cfa031f33e84556b457d5b50494a42fecd8c0a39c01a9cfa42b12142356"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl (cognitive 46): polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 23 (46 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"833832f600f91f4e9eaa86fb4f79268e5233289a706b1cbd33c888f514b77db9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::join_inputs (cognitive 46): SQLContext::join_inputs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 5 (10 pts), boolean chains 6, match/switch 4 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4524}}}],"partialFingerprints":{"codehealthFindingId/v1":"036593dd839946303e0ce90ac4d812b0a29b164f5bd38a8ebed0cdf16f0271a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.__array_ufunc__ (cognitive 46): Series.__array_ufunc__ has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13f84e3f28229ed383568f8e769b974f2c27cabcf0beae770aebb4ba90740f7"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimitiveRangedUniqueState::append (cognitive 45): PrimitiveRangedUniqueState::append has cognitive complexity 45 (threshold 15). Drivers by points: loops 6 (20 pts), if/else 4 (18 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/primitive.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f9b0c4a641a7d9a4cee23c5137cf6f28a4048711494caf8627e1ba8a0988b"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryExpr::evaluate_on_groups_impl (cognitive 45): BinaryExpr::evaluate_on_groups_impl has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 18, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/binary.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e00607e8899ed926d865678fb3090f395a1a95a08d47c3b79c755ee29f1a167"}},{"ruleId":"D2","level":"warning","message":{"text":"LineIndexer::index_lines (cognitive 45): LineIndexer::index_lines has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/field_index.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57c2a56662fa76c079c7ac5cf0a64564731503e85d901e7f260ce75b956655c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::schema_inference::infer_types_from_line (cognitive 45): polars_io::csv::read::schema_inference::infer_types_from_line has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"81365c40a7ca9024d98e795113d1298043e39332da657a293d85343e95b54071"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader (cognitive 45): polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 2 (6 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::for_each_line_from_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e50fc4ee5490a800494a259f0d26cdb1a139c3b9e613687f681e680498ccdc"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::for_each_line_from_reader (cognitive 45): polars_io::csv::read::streaming::for_each_line_from_reader has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 2 (6 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::for_each_line_from_reader_from_compressed_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3a839cd21d0ba80000430bb1681f442ca24feeb764a48d49a320abd211b4d5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::merge_join::gather_and_postprocess (cognitive 45): polars_ops::frame::join::merge_join::gather_and_postprocess has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (12 pts), match/switch 4 (6 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf2cc602c36f73d0042a9623f66bed5aa10956bee7a2ef856141cf7e72c3259"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::extract_window::extract_from_projection (cognitive 45): polars_plan::plans::optimizer::extract_window::extract_from_projection has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 5 (9 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/extract_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9babd9482a3cea8af40832638129aad1216e633cadea403503e029aa93750005"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::lateral_join (cognitive 45): SQLContext::lateral_join has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 9 (13 pts), boolean chains 8, loops 3 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f6061a99b3e0a2c828805c3e96cf38b255b00444053d0bd2cc0d0f5e2cacf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::try_attach_join_membership (cognitive 45): SQLContext::try_attach_join_membership has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (34 pts), match/switch 5, boolean chains 4, 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":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a482b2d99f2ef91573dcb92a30d4deb42fb45162f32b54973d7c31000fa7370a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::try_decorrelate_scalar_subquery (cognitive 45): SQLContext::try_decorrelate_scalar_subquery has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 7, match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275fd5f39a85a9b28d4a8bf6482c7600e38d07833c98d39aa86a607feea4ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"SampleState::try_transition_to_build (cognitive 45): SampleState::try_transition_to_build has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec12991ac3b995847c88af0a8452b2b200596bf0bdb6e1c320355d387e87d8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"IRDotDisplay::_format (cognitive 44): IRDotDisplay::_format has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6 (15 pts), match/switch 4 (8 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb92139777893f042d24d406b923f2cbc515477cc29c9f7c5117d413657d52ff"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_row::encode::encode_array (cognitive 44): polars_row::encode::encode_array has cognitive complexity 44 (threshold 15). Drivers by points: loops 9 (27 pts), if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884291a0a2169349529a8a1fac8355a38eee8400f26699c14dd72d2cb6353d5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader::finish (cognitive 43): JsonReader::finish has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (34 pts), match/switch 3 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/json/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"069f92282579dd7173454f84c8d2dcdc747579048c26ddb2f92350ebd6458e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict (cognitive 43): polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict has cognitive complexity 43 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 4 (14 pts), match/switch 5 (12 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee7c1d548a233e0b38b159c1875bc03f191648eba9846fcad0abb8552b3347b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir (cognitive 43): polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (32 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bafc201f83bbab3157a151406502c66341e108ec3d8b87e988fef54ee6e0103"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::execute_joins (cognitive 43): SQLContext::execute_joins has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 4 (14 pts), loops 2 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"743b89d735aae80843a28ffbe98cb1e465ec3525a5705d27d82f0d45620e4530"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionBuilder::build_projection (cognitive 43): ProjectionBuilder::build_projection has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 4 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadef24c4a2f37049bde3bd60d8ea51aa5f6a160f7cd0e9e287f02865ee0d58b"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowExpr::evaluate_impl (cognitive 42): WindowExpr::evaluate_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4b973170ac9c89dbd9450d1edeb4aeda1e95af474f4d7fe4aa646d14eb346a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcurrencyController::spawn_control_loop (cognitive 42): ConcurrencyController::spawn_control_loop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 5 (13 pts), loops 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":"crates/polars-io/src/cloud/concurrency/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b063ebc45178e5cdf1f7e4130e15c73a8e0d57221c9281bfdf3ed6f7fe6edc18"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::binview::decode_plain_generic (cognitive 42): polars_parquet::arrow::read::deserialize::binview::decode_plain_generic has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 3 (6 pts), boolean chains 5, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"35300c776e1d95c88757d10e5e6a24e90ddc084fbd87fbaf899ddb8a574ae0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"SourcesToFileInfo::infer_or_parse (cognitive 42): SourcesToFileInfo::infer_or_parse has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 2 (4 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb30509b427ffdc78ebd22854da9c28a36e1b86bbc18606f9f46f63469e2dd24"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupByDynamicWindower::insert (cognitive 42): GroupByDynamicWindower::insert has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (12 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"43897805a731cc35bf2e38eb5c800ceb0d85fce300642377e3e681e932207114"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_time::windows::group_by::update_groups_and_bounds (cognitive 42): polars_time::windows::group_by::update_groups_and_bounds has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee1da3c33ea47b98f9856ee27a5eb079c602e57a53e55fa8e26c8e80c61cce0"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe.numpy_to_pydf (cognitive 42): dataframe.numpy_to_pydf has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 8, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"248d5c73237bdde6f37fd27efcb384b1f8fef872a414a5f440ee61dbd3b53357"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_excel (cognitive 42): DataFrame.write_excel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, loops 4 (8 pts), ternaries 2 (3 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa52fdecef6d0d3eab7b0be0c5bdfb6ead462c98720ead7e0d79c216ec2dce0"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.prepare_file_arg (cognitive 42): _utils.prepare_file_arg has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (36 pts), ternaries 4, 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. This shape REPEATS in the file: one other method here (_utils.prepare_file_arg) 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":"py-polars/src/polars/io/_utils.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"335f9f511d5bf3221322ddc1599bfff3085ebdc42eef6e04b4368e3ee47f657f"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.prepare_file_arg (cognitive 42): _utils.prepare_file_arg has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (36 pts), ternaries 4, 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. This shape REPEATS in the file: one other method here (_utils.prepare_file_arg) 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":"py-polars/src/polars/io/_utils.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d310120305136d10d28149b2a3c8edd6acac0f7b56e51f14db31faec802c90f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame::sort_impl (cognitive 41): DataFrame::sort_impl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b680abae7417a06b1fffb9a948db5752fca34f0116f7a3065d5759d84fbacb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::planner::lp::create_physical_plan_impl (cognitive 41): polars_mem_engine::planner::lp::create_physical_plan_impl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896170359648ba9e163502f4f1b93c10ba19e5beb64405e110a4e5081fe3469"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::column_expr::specialize (cognitive 41): polars_plan::plans::aexpr::predicates::column_expr::specialize has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9752c345ed4d083f4ab177f350a9857a93730c000588e093b43af65a33740057"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::stats::node::node_stats_with_cache (cognitive 41): polars_plan::plans::stats::node::node_stats_with_cache has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 8 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"649761551a8edcef3088c957dab69c0d9ad0081cb8effb2304f9a5ec8197f79f"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBatchSource::run_parallel (cognitive 41): LineBatchSource::run_parallel has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d651c1110679b1d132024462d90a583baa7be503b428e1aa9080529d2b7b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::decimal::str_to_dec128 (cognitive 40): polars_compute::decimal::str_to_dec128 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (34 pts), boolean chains 5, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aabf4500a6d8a8607a2030cecfb2d13bc94b461bdab16130aa56fd3b83609e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::append::update_sorted_flag_before_append (cognitive 40): polars_core::chunked_array::ops::append::update_sorted_flag_before_append has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 13, match/switch 2 (5 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/append.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2deb23e4bc60c1eab98cbf75f15dc4d2ccfb4048af22e478a0733290928eff5"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalExpr::evaluate_on_array_chunked (cognitive 40): EvalExpr::evaluate_on_array_chunked has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65055fe44937a5f0d42251dbe9af4ae45d368502aa3d2cec5ce716443661406"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::conversion::any_value::py_object_to_any_value::get_conversion_function (cognitive 40): polars_python::conversion::any_value::py_object_to_any_value::get_conversion_function has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (39 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. This shape REPEATS in the file: one other method here (polars_python::conversion::any_value::py_object_to_any_value::get_list) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"53910b37ea7d47756bc6f36e05054bc7077dabc1a536c3a5a09b3b679bcb81a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::visit_binary_op (cognitive 40): SQLExprVisitor::visit_binary_op has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 10 (17 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aeee75de06b53fce40082f866e06ba64a0c72f6fd36915570855b69ed2381d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::execute::run_subgraph (cognitive 40): polars_stream::execute::run_subgraph has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 11 (17 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"382be29fc38d0f2cd57f1363fb9c218685718df655443cdb3abad54fefc7cb57"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyFrame.describe (cognitive 40): LazyFrame.describe has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 7 (12 pts), boolean chains 7, loops 3 (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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344195c62fca6964967b4a212fb65d3eceaf88ec82d2ce72cb421eee0b94ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitLines::next (cognitive 39): SplitLines::next has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcbd3c2f61dac3b98cbd5a29c7b4755fb6c24f7553852b05448837f62d9b02b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::array_to_page_simple (cognitive 39): polars_parquet::arrow::write::array_to_page_simple has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03b01888de5a6085664ea7db3aa35e3cb10ce11a3e0c2cf62163946ec4a8064"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::pages::to_nested_recursive (cognitive 39): polars_parquet::arrow::write::pages::to_nested_recursive has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef871091ffd75d1778b82f909e7791bfed8f99989ef78b07746d8480568eeab1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info (cognitive 39): polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 6, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"be28015a15e9bf01cfe17ad8767128c7d891fd67282af0026a2899e6ffcbb22e"}},{"ruleId":"D2","level":"warning","message":{"text":"BackwardFillNode::spawn (cognitive 39): BackwardFillNode::spawn has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 5 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/backward_fill.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e08f5f368207d5332aa7ef9190eec277489c424286a8497b15ffd14764e55f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_arg_max (cognitive 38): ChunkedArray::agg_arg_max has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 4 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7e34ce3aba1098f5c642c52bd32a54a34ad6d15f5d80715def839b4284e84e"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyRowHashHotGrouper::insert_keys (cognitive 38): KeyRowHashHotGrouper::insert_keys has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (13 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/key_rows.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"20776f85a3eafe0d95584b9a625d423e360519fce23133b452b298fbc9ce7bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::write::write_impl::serializer::string_serializer (cognitive 38): polars_io::csv::write::write_impl::serializer::string_serializer has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 5 (8 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 18 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891d1a903f7fab6cdb8afa72630a3a2e8f56a0445b962998a08793d5cea49a4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::path_utils::hugging_face::expand_paths_hf (cognitive 38): polars_io::path_utils::hugging_face::expand_paths_hf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/path_utils/hugging_face.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28661992dad438b235313b15819e2292d0b79bec42c15dd83cb97204e4fae5b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionExec::execute (cognitive 38): UnionExec::execute has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/union.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92204b56545ca3304afb0300395e64ebed847c803e30fee6c41269cd8e38f56"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_plain (cognitive 38): polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_plain has cognitive complexity 38 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 4 (14 pts), match/switch 4 (9 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0985008aa9cf7476fd0626ef3df7059f11adaa8ae99d9a61c5ce650716d3d558"}},{"ruleId":"D2","level":"warning","message":{"text":"ConversionOptimizer::optimize_exprs (cognitive 38): ConversionOptimizer::optimize_exprs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9bfc0bc3e54f1e629a409ebe8214acca4046c7a23cef4e065e08216b6382cd"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::predicates::column_expr::is_between (cognitive 38): polars_plan::plans::aexpr::predicates::column_expr::is_between has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28 (37 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17a42f9853f167f63d5d43be0c8d1dd4608ba5a40585c0be4fdded7c7ec5907"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal (cognitive 38): polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 9 (14 pts), boolean chains 7 (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b056fc15b0f46ef0f54d500f9917f529f416fa06ac37736718dbf16b79d84c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_runtime_filter::process_join (cognitive 38): polars_plan::plans::optimizer::join_runtime_filter::process_join has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 4, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"879cf763234ec618609ade1ffe33bd2a4b9db9604811e5226166168ca58c35e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::visit_like (cognitive 38): SQLExprVisitor::visit_like has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bad8d7c70a8a823015a52294cc50c0db58d6d80cd7c6be69ff63a5aa21fb711"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::subquery_pull_up::prepare (cognitive 38): polars_sql::subquery_pull_up::prepare has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 7 (14 pts), boolean chains 4, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b83e574c59ae9af289a771d6f9e6d2b141b7fcf2cc17e9f3d4136c7cd811b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicalPipe::spawn (cognitive 38): PhysicalPipe::spawn has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 5 (18 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/pipe.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6222cb425bdea970ba492bda48d5e37dde68f3963d04767a7dad388c14c80eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"_partition_evolution._validate (cognitive 38): _partition_evolution._validate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (8 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"22225c8531cbfe04c58fce6009b006b1dde7baf42e7f885c7259b2a8e2405b24"}},{"ruleId":"D2","level":"warning","message":{"text":"context._alter_catalog_table (cognitive 38): context._alter_catalog_table has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 6, error handling 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"662a1833270aeb92ce5b05a0d5f3484265ece881fa65ebef78fdd031ebe026b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_arg_min (cognitive 37): ChunkedArray::agg_arg_min has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 4 (9 pts), loops 2 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c411c83a56ac9211cbfec6fb50c257407a14fd3c64790dfc7b4e7c859cbfe100"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::fmt::iso_duration_string (cognitive 37): polars_core::fmt::iso_duration_string has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ac01df8042d468ac927e685014f87404d920900400aaea4ff00893414c1dd"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalExpr::evaluate_on_list_chunked (cognitive 37): EvalExpr::evaluate_on_list_chunked has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a10119467f17fb238698ceb28115b831b25f582bb92ed225aa6046ceecb354"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleKeyHashHotGrouper::insert_keys (cognitive 37): SingleKeyHashHotGrouper::insert_keys has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (12 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/single_key.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"328ed91037cf4c1c114d2ff85a758a945325e5f25951f6ee4d4c183780389444"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::executors::group_by_streaming::can_run_partitioned (cognitive 37): polars_mem_engine::executors::group_by_streaming::can_run_partitioned has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), 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":"crates/polars-mem-engine/src/executors/group_by_streaming.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebe8a1382360b8fdb307dda61d9a7fb5fcacc59fd7fcbacaf62f2be9f3549a9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::executors::projection_utils::check_expand_literals (cognitive 37): polars_mem_engine::executors::projection_utils::check_expand_literals has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (7 pts), boolean chains 4, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/projection_utils.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d34ab99ca00120a71a872c119bdd11fab59aa672cf0d57083a879bcda4e882"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_binary (cognitive 37): polars_plan::plans::optimizer::simplify_expr::arity::simplify_binary has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 9, match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"509cc31f84c0784015ed211d67e199a0006136c3ad1ba41df84cbb1a20f0c4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::get_table (cognitive 37): SQLContext::get_table has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5852}}}],"partialFingerprints":{"codehealthFindingId/v1":"19da5a1df93910b50d9407e30813546b974ea3d6507ca309b25eba19407f508d"}},{"ruleId":"D2","level":"warning","message":{"text":"ForwardFillNode::spawn (cognitive 37): ForwardFillNode::spawn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/forward_fill.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eed351b17ad23e8f168e8e8025658b11656b779ed59df1f6a9d8ea2f47ff67"}},{"ruleId":"D2","level":"warning","message":{"text":"DeletionFilesProvider::spawn_row_deletions_init (cognitive 37): DeletionFilesProvider::spawn_row_deletions_init has cognitive complexity 37 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 6 (15 pts), match/switch 3 (5 pts) (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a77763f479e78b866a8926c7321a1e4be0c4dd627ed3f9f754fcf667142b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"MorselStreamReverser::run (cognitive 37): MorselStreamReverser::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"093d6d401399225f51c8ad935e273a16925dd8ab648b9e4671bc1df3a21676db"}},{"ruleId":"D2","level":"warning","message":{"text":"RleNode::spawn (cognitive 37): RleNode::spawn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/rle.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"278df78edb1a25bae5275870d9bca28a733fdb64a348ecddc7d06b4a7144e4ac"}},{"ruleId":"D2","level":"warning","message":{"text":"StrptimeInferNode::spawn (cognitive 37): StrptimeInferNode::spawn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/strptime_infer.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85263920963ff083df6987d5006d7cbf2c366a8aed770f58751a292c794a5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr (cognitive 37): polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b744e6752613c27d137175fd4273409be018e53698ebfa49c1c254b1ecd21d92"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._get_sheet_names (cognitive 37): functions._get_sheet_names has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, ternaries 3 (7 pts), loops 2 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"643bde1819c5b073fec3e1644a4b93906e7df38ad410775f2bdaba1e8f25ee6e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::is_in::is_in_helper_list_ca (cognitive 36): polars_ops::series::ops::is_in::is_in_helper_list_ca has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 5 (9 pts), match/switch 2 (5 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (polars_ops::series::ops::is_in::is_in_helper_array_ca) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"153b57095d2f360078e66e14f04a1dba6529f3e207a3bee9ada7a472429be63b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::is_in::is_in_helper_array_ca (cognitive 36): polars_ops::series::ops::is_in::is_in_helper_array_ca has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 5 (9 pts), match/switch 2 (5 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (polars_ops::series::ops::is_in::is_in_helper_list_ca) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad4628851438ceacff007c3149f4434c8fa68749a54c3e59f6b7e466adfbde5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::sinks::validate_sinks (cognitive 36): polars_plan::plans::conversion::dsl_to_ir::sinks::validate_sinks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (6 pts), match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sinks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36a2c3a6b15f4e16c10ce7bd3e41fb1ce563b8cd0f08860d3678a8d7d2d382c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_join_on_subqueries (cognitive 36): SQLContext::process_join_on_subqueries has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d189bd71214fb35924bd8be7121148850c882602b42785a50c4a2277b969a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl (cognitive 36): polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd6b52554fb11bcb9e4d60dc228f3c7389beffd236646037084938efa26800c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::rolling::create_validity (cognitive 35): polars_compute::rolling::create_validity has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6d65c7f51a2a435c3c925e112e58797461e34689cc8cb5402f8b77601e00fe"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::utils::supertype::get_numeric_upcast_supertype_lossless (cognitive 35): polars_core::utils::supertype::get_numeric_upcast_supertype_lossless has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae129f6707496181934dcb9e94806a61fc5271689b83a6fa450b0f0e774f132b"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleKeyIdxTable::probe_impl (cognitive 35): SingleKeyIdxTable::probe_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (14 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/single_key.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce176518e2d4b25db7533fb56ae49ad9aeb580d0cb893ba9c80965166c244b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::join::build_upcast_node_list (cognitive 35): polars_plan::plans::conversion::dsl_to_ir::join::build_upcast_node_list has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 8, match/switch 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"192c5353e26b47b912a8ea85c000c2902b69b847e48ca640bfe909f25682e70d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::aggregate_from_statistics::aggregate_from_statistics (cognitive 35): polars_plan::plans::optimizer::aggregate_from_statistics::aggregate_from_statistics has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/aggregate_from_statistics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635138d04e3e5058e5a074425aa42b78e23b3130a67b8b4ca0c28eecc033e22"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::try_first_row_order (cognitive 35): SQLContext::try_first_row_order has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (6 pts), boolean chains 4, loops 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":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"853e163a5813161182f9794aca97cc388ee7c9c3b8c1a3521116266d9b30f3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyExtraOps::initialize (cognitive 35): ApplyExtraOps::initialize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/apply_extra_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"191d43cab8d43b4d0b3e62abee1e1320b0ad6ab1db886b7c43714bb0389c12ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnSelectorBuilder::attach_iceberg_transforms (cognitive 35): ColumnSelectorBuilder::attach_iceberg_transforms has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 4 (10 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8edfce5add89965b78a623282d3fe2b608530308d8139a207753de0cd80c16f"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyPolarsSlice.apply (cognitive 35): LazyPolarsSlice.apply has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 18, ternaries 5 (10 pts), if/else 5 (7 pts) (nesting depth added 7). 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":"py-polars/src/polars/_utils/slice.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"41288e79228b0d5683df36498dcb6b57c20a77f5d9188f52ddf10b65f2b9e05c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaDataset.to_dataset_scan (cognitive 35): DeltaDataset.to_dataset_scan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 11, ternaries 4 (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":"py-polars/src/polars/io/delta/_dataset.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba6e24f53036a8b78347460068c431cb3ce4412ada58656037d705da3ce756"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::parser::next_line_position (cognitive 34): polars_io::csv::read::parser::next_line_position has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 19). Of this number, 31 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":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e67fb60f7d1fdf9640e922bbabe35d2005147b71706ef79f4092d2be997f23"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader (cognitive 34): polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::read_until_start_and_infer_schema) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae404abea63625d020db9e3bf4f7cd88c1c213b314e4e1f791488e1feba0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::read_until_start_and_infer_schema (cognitive 34): polars_io::csv::read::streaming::read_until_start_and_infer_schema has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad0343d30209114ead7c941584b3ff8344796cb6ef834966695097a7b5a959"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::ndjson::buffer::deserialize_all (cognitive 34): polars_io::ndjson::buffer::deserialize_all has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 7 (12 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ndjson/buffer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae1501b6cb2f78e6d7ddf2806903a8acb0d8e4d5d3d8093f8285e57dc6a3c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LeafRows::collect_run (cognitive 34): LeafRows::collect_run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (7 pts), boolean chains 6, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37e759ea1917a3ca56ca3b4261ede5ad89d32802b210bd69d077209cae06b4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner (cognitive 34): polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 4 (7 pts), loops 3 (6 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b5b7758c3ac026588b1fcf317e330853b65c4578a296e6003bd7153d83c0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::stats::value_range::column_value_range (cognitive 34): polars_plan::plans::stats::value_range::column_value_range has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/value_range.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97196d3ec592022987ba3c0279152b2ae4ee98eecd87123966b0dfcb1343c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_parquet (cognitive 34): DataFrame.write_parquet has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4219}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb2f8a016e6256aa65732dabd63605bf573e5c5999fe091af0810c89cb9b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Series._comp (cognitive 34): Series._comp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, error handling 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b58af64ca7b2f8428a95a179df6921d57d9efa412f9c93a8e995910d07d501"}},{"ruleId":"D2","level":"warning","message":{"text":"GatherExpr::evaluate_on_groups_impl (cognitive 33): GatherExpr::evaluate_on_groups_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/gather.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559df0ede79104eb8db7ea1dfa8c7c71e69a5240c55b22b2deb4d760a83d09f"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::try_open_check_latest (cognitive 33): Inner::try_open_check_latest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/entry.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2748455aad45ae8a586fcc8113372cda17ec4445eab988a3771f9f1edb23844"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::planner::lp::python_scan_predicate (cognitive 33): polars_mem_engine::planner::lp::python_scan_predicate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (9 pts), loops 1 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e08f8eb795296d3d6320cf227db2784fc16db3bce28eb3b09cebaea8f135de"}},{"ruleId":"D2","level":"warning","message":{"text":"CategoricalDecoder::unspecialized_predicate_decode (cognitive 33): CategoricalDecoder::unspecialized_predicate_decode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (10 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/categorical.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9165a0241ad17cfecf3f21de1f3152592e95d306e6d7a23659b997c5fcd20365"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::comparison::_list_comparison_helper (cognitive 32): polars_core::chunked_array::comparison::_list_comparison_helper has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_core::chunked_array::comparison::_array_comparison_helper) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"817a70693ec3a77416e641a55418c6b15d6e2e37c96884731f3964adcad0770b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::comparison::_array_comparison_helper (cognitive 32): polars_core::chunked_array::comparison::_array_comparison_helper has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_core::chunked_array::comparison::_list_comparison_helper) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"efade66ef9e1e900639711823befa4bf534b15d9a402777736c8656fe8e9e1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::split::split_regex_helper (cognitive 32): polars_ops::chunked_array::strings::split::split_regex_helper has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 6 (10 pts), loops 2 (5 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69e8eb4fe2a3ed258a469f0db41d582c44d6ff7ec7670728d86d27ea9ec9a30"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::merge_join::match_keys_impl (cognitive 32): polars_ops::frame::join::merge_join::match_keys_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c988c48ef77469f42b0218ca9d170aa792d2eec4083041e0b0d119bfff2aae21"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::rank::rank (cognitive 32): polars_ops::series::ops::rank::rank has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (20 pts), match/switch 6 (8 pts), if/else 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rank.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a91a354219696e25939b068df8ca5efac00edeac5f50cb72eebd72e67d0a254"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::round::apply_float_rounding (cognitive 32): polars_ops::series::ops::round::apply_float_rounding has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (32 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d699bbf85f9a1791ac433de770663fd9b697e74c3f80a67d493b96bb454f76c5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::strings::str_format (cognitive 32): polars_ops::series::ops::strings::str_format has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (14 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/strings.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bef205414806058691191d5dadeeed46f3b432b02fb005840c6d5e81ee0788"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::order_keeping::order_keeping_column_rec (cognitive 32): polars_plan::plans::aexpr::order_keeping::order_keeping_column_rec has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/order_keeping.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d111a024cbb689506d3db6ffaf6de5b3665a6489f2174726575f05cb62c67cc"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::parquet_file_info (cognitive 32): polars_plan::plans::conversion::dsl_to_ir::scans::parquet_file_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (12 pts), match/switch 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"40baad72d20ed8c5f870c9498cafec78af1d0505cbd33f8a3522dc47f3c29488"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::try_decorrelate_in_subquery (cognitive 32): SQLContext::try_decorrelate_in_subquery has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 5 (9 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de646cbb5d0794eb9deb102f69e971e9b05e49b51b1d793fdd0552d7c585652"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::to_description::phys_props (cognitive 32): polars_stream::physical_plan::to_description::phys_props has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 5 (10 pts) (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5a671584afef9e5d433147d0bb8bcdc07cdc74b465c663c923607ab71e5462"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyFrame._filter (cognitive 32): LazyFrame._filter has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 11, ternaries 5 (8 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad42c1efdb2d02a9f594719667679f67d36a4a4befc27c9f394b30e6c1f2ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector._by_dtype (cognitive 32): Selector._by_dtype has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (14 pts), boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a25bb9e6f2b2616be05b9a02357e6c4575092a98cf7ff4183f580a4fd747b"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudOptions::build_aws (cognitive 31): CloudOptions::build_aws has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c7155e40a98530f6c6b1ed754b2906d6294ec6881895d228e37e614af5d8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_order::cluster::extract (cognitive 31): polars_plan::plans::optimizer::join_order::cluster::extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 8 (12 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3ba03239493120031af1d05a4e4365ea641c50b1bc4152650ca01477805bb"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::visit_expr (cognitive 31): SQLExprVisitor::visit_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"47955bc4c7589be4cd85141e4acb2e58b8649126ec0ebb118b13214ca75a617d"}},{"ruleId":"D2","level":"warning","message":{"text":"Shared::run (cognitive 31): Shared::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/flush.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4ec15996ed925260527b89d40360e90349928b9e22837276fec5f24774d606"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvFileReader::begin_read (cognitive 31): CsvFileReader::begin_read has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 6 (7 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"958043b7b284aaa0e7125e36109bf5e7678ca1e68f924bc87f5a1ac95d7298fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBudget::acquire (cognitive 31): PipelineBudget::acquire has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, match/switch 2 (7 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":"crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eda20e8107c5695e3d59325bd710b878f7556cb86bef072b01577b72f01b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe.iterable_to_pydf (cognitive 31): dataframe.iterable_to_pydf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"1985268543b548042fb63aa52c21ce04e3784444afe28adacd4999192d54967a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToArrowConverter::array_to_arrow_impl (cognitive 30): ToArrowConverter::array_to_arrow_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579a013532321d97d4734866b338ecb93cf7a30691fac2643531e02fa263b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"StructEvalExpr::evaluate_on_groups_impl (cognitive 30): StructEvalExpr::evaluate_on_groups_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/structeval.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"387f82655ed6947f3ad5e3853af80eda9c11249df328d05e1ef139174a01d139"}},{"ruleId":"D2","level":"warning","message":{"text":"StackExec::execute_impl (cognitive 30): StackExec::execute_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (6 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/stack.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6db9c6f4085650ddd510946a5f75e10c7f3f7bbcbe6acd43260a96318376fce"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::array_to_page_nested (cognitive 30): polars_parquet::arrow::write::array_to_page_nested has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7facb939d236ea8309a5d180244bc58b8c5f93ad0a7c19d7401dd73e6122f3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::lazyframe::visitor::nodes::into_py (cognitive 30): polars_python::lazyframe::visitor::nodes::into_py has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccf97175dd6f598e0e2dc7240ddc4c051b39442d3565275a6a1ce9f2748ee1b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::rewrite_exists (cognitive 30): SQLContext::rewrite_exists has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64416db6e0bbb1e5ec039ee1ab8a6be7177b1262ad73e0c6d5b6c3161a8c57e"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionMorselSender::send_morsels (cognitive 30): PartitionMorselSender::send_morsels has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_morsel_sender.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2019c941dc9d1ad2bfa95b55dabf0183aaa273083f21742bdc9b83d580520157"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatchDataFetcher::run (cognitive 30): RecordBatchDataFetcher::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec03fd71b7dc6a4b353b0f728153e25dbca7cb38095b1e17d33f944511c7f76"}},{"ruleId":"D2","level":"warning","message":{"text":"SortNode::partition (cognitive 30): SortNode::partition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 10 (15 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"30649917ae7b41128548b019a55febce0ae3c4cea195e435e7a7b632040d71e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Shuffle::run (cognitive 30): Shuffle::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/evaluate.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1cfbc52ef7bfc15ba68bc40d664d38d549ebef9aa7caeb0bcf30723667a472"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::merge_sorted::find_mergeable (cognitive 30): polars_stream::nodes::merge_sorted::find_mergeable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (6 pts), boolean chains 3, loops 2 (nesting depth added 12). Of this number, 29 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":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e3684b3d77f1697f91e9027cebd22caf549c992b0b6b8607a28b85ae3346d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RawTable::try_find_or_insert_impl (cognitive 30): RawTable::try_find_or_insert_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01513f880d1cbbae51fd94fd94dee815e08aa25c09f30aebe919ce569bf460a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionExecutor.execute (cognitive 30): ConnectionExecutor.execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 10, ternaries 3 (5 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"61accab62400e351f7bf0e0c0a7107a2ba9f950b0aac0283a50185d9c8d22285"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyFrame.update (cognitive 30): LazyFrame.update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2, loops 2, ternaries 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":8976}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb03e30d39f485a045116768bf05bc2a0e750db611b267880267d46af3e32d88"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_list (cognitive 29): ChunkedArray::agg_list has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/agg_list.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"217a4504f60b0f9fd2af348e1e1a650eb2136e326f33c1ad8d8182bb0bab204a"}},{"ruleId":"D2","level":"warning","message":{"text":"StrpTimeState::parse (cognitive 29): StrpTimeState::parse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/strptime.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb192dbd65225bad58015accec06f671800f0f2ae45758d17daaae2816b61c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::functions::create_scan_predicate (cognitive 29): polars_mem_engine::scan_predicate::functions::create_scan_predicate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4dd3943301dc9cfd883731e138c6c856a00b9584d10d68bf13caae5d73d62e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::concat::hor_str_concat (cognitive 29): polars_ops::chunked_array::strings::concat::hor_str_concat has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/concat.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd064201205a558ed5cdb049bd00209a43fd4335ab043c6cd5a2b65fb8c1f266"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::find_many::extract_many (cognitive 29): polars_ops::chunked_array::strings::find_many::extract_many has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 4 (11 pts), if/else 2 (5 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"32686b329ce4f2bb705b56d4b4b9b1f624072d1829ec1a9c4034b76c451ab220"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_logical_type (cognitive 29): Parser::parse_logical_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"117807e929a89e1831bd1ff6f87245d7003aedf96485ae521b56a51e3c477eec"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::binary::dictionary::decode_dictionary (cognitive 29): polars_parquet::arrow::read::deserialize::binary::dictionary::decode_dictionary has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binary/dictionary.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5e43a9ddd564c745d962d6253d3432a8d1dc4045c407f9be679a3218f22aab"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::schema::to_parquet_type (cognitive 29): polars_parquet::arrow::write::schema::to_parquet_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/schema.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cab1f18ff38c57835d83abb1822492007056362d5cc59b8dbdaf941bb0939e9"}},{"ruleId":"D2","level":"warning","message":{"text":"AExpr::is_fallible_top_level (cognitive 29): AExpr::is_fallible_top_level has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 1 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf934390d022d63ad6c4f938edf966648358ca7e6abe251c62c0d973c5203d1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_outer_equi_join (cognitive 29): polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_outer_equi_join has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"367bd83272c75b25b26810fcd927ef75b53c27c28269d221299593f6b47426aa"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl (cognitive 29): polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a851a84891d6184218240729b7c4de6be7858284d532be47c16e746e765120a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_row::decode::decode (cognitive 29): polars_row::decode::decode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (9 pts), loops 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":"crates/polars-row/src/decode.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8838bdda318ac64e5d4de86ff04b5a0b18cd61867b89b0465a2dc542b2747ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::context::merge_source_columns (cognitive 29): polars_sql::context::merge_source_columns has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (8 pts), match/switch 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":"crates/polars-sql/src/context.rs"},"region":{"startLine":8909}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a71e91f7a888013e2b18e3df140c850763452118cd7ef4d7f4bb849ee6aa33"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::update_all_states (cognitive 29): Graph::update_all_states has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/graph.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cad129b15434205852d7c9ae727cc382bdec62f74535b388d40e15acc395161"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpolateNode::spawn (cognitive 29): InterpolateNode::spawn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/interpolate.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015e2b7e41e0f05aa778963b09cfd6a10d65ddaf54c945e35109fc101d3c6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"SampleState::try_transition_to_build (cognitive 29): SampleState::try_transition_to_build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3a0aef5c3b2dd5021e7f39ae8217512d1076c446dcfc2c3476afe28441d757"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe._unpack_schema (cognitive 29): dataframe._unpack_schema has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 4 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"751ca7f1c2849c6847dfcbe9bce500efb4c31e186a2481479e051e4de0235824"}},{"ruleId":"D2","level":"warning","message":{"text":"general._from_series_repr (cognitive 29): general._from_series_repr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/convert/general.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee52dfaee81275cc6ef473a54a4c93ce1bc64aea1bdfec66dc11e22dd59bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaSinkState._add_actions (cognitive 29): DeltaSinkState._add_actions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a257d69868a0729d591755b259e47280c1629cd0b9dc5e6295dcbf13b813c6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"_write_utils._xl_apply_conditional_formats (cognitive 29): _write_utils._xl_apply_conditional_formats has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 3 (10 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e2418f52e8741922164aeac407e75f59aa1e63396a266642e5e2dacfd4df7"}},{"ruleId":"D2","level":"warning","message":{"text":"core.series (cognitive 29): core.series has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/core.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbee26e86a359374fb33e0762fb053bad83dca72af06d868136f88eb0f2c1eac"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::bits::first_true_idx_impl (cognitive 28): polars_core::chunked_array::ops::bits::first_true_idx_impl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/bits.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0db2b74552bf51f99fa02c2f4935b1797f55df5700659193b6cd09faf51e34"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::fmt::fmt_float (cognitive 28): polars_core::fmt::fmt_float has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e26ec50b786c366f330f10b20abc3b26156c64857085553ef69d6d398b0d2"}},{"ruleId":"D2","level":"warning","message":{"text":"RoundSeries::round (cognitive 28): RoundSeries::round has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"19917aadda06cfd7bcfaec1da8f8003394004c6dbcfaaf840dda40510c84944c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::iejoin::piecewise_merge_join_impl_t (cognitive 28): polars_ops::frame::join::iejoin::piecewise_merge_join_impl_t has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 3 (13 pts), if/else 4 (8 pts), loops 3 (7 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"218dc4b2129528e0d97d85d1201508c8e0ead304f61214fd41fbb0e233a40442"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::optional_masked_dense::decode (cognitive 28): polars_parquet::arrow::read::deserialize::dictionary_encoded::optional_masked_dense::decode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b663651118a2a926052fa2d13307e81ab3955bacf0742b2b973ef955466eb729"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::required_masked_dense::decode (cognitive 28): polars_parquet::arrow::read::deserialize::dictionary_encoded::required_masked_dense::decode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f570799d149297d1e707bf4611dc6cbc5c060006546445c39e46c80dab305"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::dictionary::array_to_pages (cognitive 28): polars_parquet::arrow::write::dictionary::array_to_pages has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/dictionary.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"09753fb1861a6a405ff0c612e4b168d5b23834b05ad2f4eeccdc258b22f71637"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::properties::general::predicate_non_null_column_outputs (cognitive 28): polars_plan::plans::aexpr::properties::general::predicate_non_null_column_outputs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/properties/general.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a382cf3be4ec1755dd915d57d6c19d4cf12c03256ba2b856a3fccc37445a32a4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::execute::execute_graph (cognitive 28): polars_stream::execute::execute_graph has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 6 (12 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9446ef34c99503c571d4e98ee5b50552939eb74fd7cfccac861deaf4741dbf8e"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe._sequence_of_sequence_to_pydf (cognitive 28): dataframe._sequence_of_sequence_to_pydf has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b66431bafe781f37edfe8657439a11a33a1cadee443ba2845fd2be8adbc85b"}},{"ruleId":"D2","level":"warning","message":{"text":"getitem._convert_series_to_indices (cognitive 28): getitem._convert_series_to_indices has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aa4a7a9cbc21e0d1472f9284ec139a48716490096f749fb06b8a40c63991c1"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.to_numpy (cognitive 28): DataFrame.to_numpy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DataFrame.to_numpy) 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ffc49859ab3ec776d504a52af6ce2d494386cbf0ef32cd14e729efc269823"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.to_numpy (cognitive 28): DataFrame.to_numpy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DataFrame.to_numpy) 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05556be8a5cc800179c9efc3e885c9eaa6e32ee0c41a09d5edb724dfc49990e"}},{"ruleId":"D2","level":"warning","message":{"text":"eager.concat (cognitive 28): eager.concat has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85201f474832877d32413cb0eedbb819e9e5235ff2f567451aa90c040a7597f"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergSinkState._commit (cognitive 28): IcebergSinkState._commit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 3 (6 pts), error handling 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b609593acbdb91e5c302d8efbfb6dea4aa96c2cada5d8392558f491d7502ed66"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_list (cognitive 27): polars_core::series::any_value::any_values_to_list has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (9 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e17aa02386b801df7e6db84f7fce75908dacb8f4e21b20bd78e8f5a6547135"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleKeyIdxTable::insert_keys_subset (cognitive 27): SingleKeyIdxTable::insert_keys_subset has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts), match/switch 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/single_key.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd4b1b6880696a39e05da1925e51233bcf3b7397290e71e6c91c1d5fd92fb2d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::expressions::window::set_numeric (cognitive 27): polars_expr::expressions::window::set_numeric has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (16 pts), match/switch 4 (9 pts), if/else 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f54463c51a348847b2dd9d76f0300abda54dd06809242c9d0e6e43bd740095"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::cloud::dns::lookup_hedged (cognitive 27): polars_io::cloud::dns::lookup_hedged has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/dns.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e58f3717d6624aba6c1854f88db17e3ddf21237f4d399d69adf29cdab1bcef"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::builder::slow_datetime_parser (cognitive 27): polars_io::csv::read::builder::slow_datetime_parser has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7b08691b0456c923b24b9841622f85e66bfe4d52dceb8f5c9b19885bf9dc1a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_struct (cognitive 27): polars_ops::chunked_array::gather::chunked::take_opt_chunked_unchecked_struct has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27844ff1fd227c511c2c8af5c10600727f13da0535fbe5f0762f6734eea573f"}},{"ruleId":"D2","level":"warning","message":{"text":"IRStructFunction::get_field (cognitive 27): IRStructFunction::get_field has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 6 (9 pts), loops 1 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"80749044104ceb344ead875c0adb9869050d9b34645d62b0be5262f3cd5c9c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"IRDisplay::_format (cognitive 27): IRDisplay::_format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (8 pts), match/switch 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843dcae979f233e743edc6eeac3dff53f2f9229ace3487d814b8aee3ff28fed"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::merge_plan (cognitive 27): SQLContext::merge_plan has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 7 (12 pts), if/else 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e2e9590f46ec4bd9811144c3f088397d256c7515cdfa78ebcd18f54d590cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildState::finalize (cognitive 27): BuildState::finalize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"af629aedd27fe0abc4a3a27c3d292cb2626e8cf12a5a7710b72f36f1dbd9849f"}},{"ruleId":"D2","level":"warning","message":{"text":"ShiftNode::update_state (cognitive 27): ShiftNode::update_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/shift.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba34c9e1888f8ad2ae8f64d7a12dd4bc826f0340c8c16703b8a9e2045537dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"SortedUnique::spawn (cognitive 27): SortedUnique::spawn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sorted_unique.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e8e8df17a5e4d2e1719e4257cbf0da90287a18870ca8d8ba741bf4fcff477e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::asof_join::distribute_work_task (cognitive 27): polars_stream::nodes::joins::asof_join::distribute_work_task has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ae9081071f485dc1d3d8a8441bd6d9391cee39e6ca6ebe03ba0a7caf5425b"}},{"ruleId":"D2","level":"warning","message":{"text":"eager.union (cognitive 27): eager.union has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66b6e0dc0dd28c7f0f182caa92cb27f5c5b7cd188d610523c66036191f676b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionExecutor._from_arrow (cognitive 27): ConnectionExecutor._from_arrow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 4 (8 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f5b41ee7428da303a3d4f4da91583628eb6f5218dfee68280dd4f9555f3bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"_partition_evolution.partition_source (cognitive 27): _partition_evolution.partition_source has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_partition_evolution.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b54d1f23b464ebcf0a0267b8e71f97c106a12b2c372af1b4d713b4a96b0196"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergSinkState.new (cognitive 27): IcebergSinkState.new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8, ternaries 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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5419d178cd0f873baf51bb37dab372a827e42a53f408d90509d5a1f0b62ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"Series._arithmetic (cognitive 27): Series._arithmetic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (23 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5ec85869ad73666cd13930ab057ce4ea1f4299283a47e77f596d1da62bbb96"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::schedule_task (cognitive 26): Executor::schedule_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-async/src/executor/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5168f101b13993be2c00b27e23ea9eb7d5d12c03281f9957e380050980e0390d"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockUnion::get (cognitive 26): BlockUnion::get has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/quantile_filter.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77611a67c2e18283324ed4bc6f9a5ed5b3c6678ed0461706968e214328870b0"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowExpr::map_list_agg_by_arg_sort (cognitive 26): WindowExpr::map_list_agg_by_arg_sort has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (18 pts), match/switch 3 (6 pts), if/else 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb2bd7153343a7ec3b5153c38de16eb70b072e3a4090d73dafd632a8a7a830e"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitFields::next (cognitive 26): SplitFields::next has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/splitfields.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d2069cbe31d3332631a60c2405d0ef18559b70ecb3179ac77bb1b7ec65679"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::schema_inference::infer_field_schema (cognitive 26): polars_io::csv::read::schema_inference::infer_field_schema has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 4 (10 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a40a747eade495c8f62da0702eae8c3968be2ce18b96c065d653388ac29ec"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::hash_join::single_keys::build_tables (cognitive 26): polars_ops::frame::join::hash_join::single_keys::build_tables has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d93fa7291d396f98d442ce6d2ac79634ed146054b3f53a4bf1ff0ca8095a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::get_encodings_recursive (cognitive 26): polars_parquet::arrow::write::get_encodings_recursive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ff2065beed6842e0578600a5479bab2977c65a193feb7733acb14ea7568a88"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::group_by::process_group_by (cognitive 26): polars_plan::plans::optimizer::predicate_pushdown::group_by::process_group_by has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/group_by.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03e9dc5aaa4831eb0a1ce5e8ea13f2424724ebb5ff3d2325e9fbadbf8e8fa2b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_wildcard_additional_options (cognitive 26): SQLContext::process_wildcard_additional_options has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6876}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb12078b5c159558db216aa36cd2ea12ecb3367b2560300f78f45000f822cbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBatchProducer::next_batch (cognitive 26): LineBatchProducer::next_batch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/line_batch_distributor.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed74746069309224b01ad67f9ae5ab5d13a8ba2116a8afeec836c2d6e3c29d14"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice (cognitive 26): polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fce5896a04da3b4558745a44a03b8ea51f432d2c20f774084c3dbc1a8f8cf88"}},{"ruleId":"D2","level":"warning","message":{"text":"getitem._select_columns (cognitive 26): getitem._select_columns has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (24 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":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad658fe390dae29448257760a166e33e1213164c185c869415a1f41fe9aae24"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergSinkState._commit_create (cognitive 26): IcebergSinkState._commit_create has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 3 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b87a45bdc50136fde6b1a183de29785c09ad242b6968c42e23ae9e7adfecad5"}},{"ruleId":"D2","level":"warning","message":{"text":"LanceScanResolver.resolve_lazyframe (cognitive 26): LanceScanResolver.resolve_lazyframe has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 4 (5 pts), boolean chains 3, error handling 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":"py-polars/src/polars/io/lance/_scan_resolver.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61117ea32a6a8ba0447464897b3752431014b9136eb2b0d9326fcaac33e8d83"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::runner (cognitive 25): Executor::runner 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":"crates/polars-async/src/executor/mod.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7006e39d60aa0066267e2bf593b1b7ffa981ee4f27383d535f8e44516c9c16"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueBufferTrusted::add_physical (cognitive 25): AnyValueBufferTrusted::add_physical has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"236190f9ee42509fcf93a20e158c50675f4470f770647b1c7963d3a30b9aa3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericFixedSizeListOpHelper::execute_op (cognitive 25): NumericFixedSizeListOpHelper::execute_op has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 4 (5 pts), loops 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"892401058b78227545b138ad1407879027481aecc9079e5b52e86d9a3058be3c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::frame::validation::validate_columns_slice (cognitive 25): polars_core::frame::validation::validate_columns_slice has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/validation.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bf2c09e98c5386159a166f4cb7c3f18a8157540a82886e25cca49d090e3175"}},{"ruleId":"D2","level":"warning","message":{"text":"BinviewHashGrouper::insert_keys_subset (cognitive 25): BinviewHashGrouper::insert_keys_subset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (25 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"419bbe7f1eb166cc6af3b418ff3764101138e689e51d589d32cfedf0787ae7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleKeyHashGrouper::insert_impl (cognitive 25): SingleKeyHashGrouper::insert_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (5 pts), match/switch 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/single_key.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566f70a84a9347c88192a82ccd8327d2f600d7a2894c76660f11da4e2878cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::reduce::convert::into_reduction (cognitive 25): polars_expr::reduce::convert::into_reduction has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 6 (11 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/convert.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1472cae41d70a8bc61105bb79cfe298a46044950076f1d3b0f340ad425241ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::find_many::find_many (cognitive 25): polars_ops::chunked_array::strings::find_many::find_many has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 4 (10 pts), if/else 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0284a3f4d00ad6d18000c946cfa71a83429c8d8f798a253ccb4ed7f04fac07a9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::strings::split::split_helper (cognitive 25): polars_ops::chunked_array::strings::split::split_helper has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (11 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f250e150b07d7887bc4d84365565a82ad312760e8493c2e86803e5bd0f8b173"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::nested_utils::collect_value (cognitive 25): polars_parquet::arrow::read::deserialize::nested_utils::collect_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ee734d146e02b455662b26057a4eb07a63f2af67dedfcfdf4e4e9a1d712558"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionWalker::walk_as_struct (cognitive 25): SelectionWalker::walk_as_struct has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089cf5ceea1452198ad890ae86b45a387d95dab33d233cd8cbf21b0b4833a51"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::dsl::functions::concat::format_str (cognitive 25): polars_plan::dsl::functions::concat::format_str has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/concat.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8427f9066d53eff08453b17d46c499aac4fd0c2d377910facfad6fa5719ca504"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::binary::process_binary (cognitive 25): polars_plan::plans::conversion::type_coercion::binary::process_binary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dce215f4b41cd14bcc4deb0c949749d968e47ebb9168756af86893e852640c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::time_travel::extract_table_versions (cognitive 25): polars_sql::time_travel::extract_table_versions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/time_travel.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d00e0e48c5f7b2afe9ba78769717adedc49199f147f0f935810f77f26041db"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::parquet::projection::resolve_arrow_field_projections (cognitive 25): polars_stream::nodes::io_sources::parquet::projection::resolve_arrow_field_projections has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/projection.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"78125cccd9fd72c343e084a60a646c5bbfc46e9c1dd03dabf7d878609ac777ef"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::merge_join::find_mergeable_search (cognitive 25): polars_stream::nodes::joins::merge_join::find_mergeable_search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, boolean chains 10, match/switch 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e53008296095527947d60dd2a0caaa7722c32f74662b66ffe07cc2201410a3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::sort::partition_frames (cognitive 25): polars_stream::nodes::sort::partition_frames has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e0c1e3e9ff71ff9097c4067d5469fcb97d11352cc83e3c715a80ec4aaa897d"}},{"ruleId":"D2","level":"warning","message":{"text":"_sink._check_writable (cognitive 25): _sink._check_writable has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"904d327fe3a826b069ea4e7de86608497234f727524e7ce68a38d7653f536f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"_sink._added_conflicting_deletes (cognitive 25): _sink._added_conflicting_deletes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dbbd43e8627bd013fbd4981858fcb614b147b1385bff1b2b25e388e60a8702"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::decimal::divrem_256_128 (cognitive 24): polars_compute::decimal::divrem_256_128 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 11 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8d0b67101625b4c67b080d078f828fb4662273016526e73d70e1adc62c014b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::gather::fixed_size_list::take_unchecked (cognitive 24): polars_compute::gather::fixed_size_list::take_unchecked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/fixed_size_list.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"89218514e305a20c336667dc1bcac1fc590f07da31e5e218b297952d6b0ef5f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::explode_by_offsets (cognitive 24): ChunkedArray::explode_by_offsets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/explode.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e01f7fba4d801beba910444b3bfb265d01c98a71b85270696a8e1c7790617"}},{"ruleId":"D2","level":"warning","message":{"text":"ListNumericOpHelper::_finish_impl (cognitive 24): ListNumericOpHelper::_finish_impl has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 6 (9 pts), match/switch 4 (5 pts) (nesting depth added 10). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (check_mismatch_pos, combine_validities_list_to_list_no_broadcast, combine_validities_list_to_list_broadcast_right). 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":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df550c9910484206a2955bac73297962d7389f50e1623e0cfae443b21c45584"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::search_sorted::search_sorted_slice (cognitive 24): polars_core::chunked_array::ops::search_sorted::search_sorted_slice has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (8 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/search_sorted.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f392120a082bde863a22ee6331a2f1bef840b482619f0b4899b63b7b0565f3"}},{"ruleId":"D2","level":"warning","message":{"text":"AggMinMaxByExpr::evaluate_on_groups_impl (cognitive 24): AggMinMaxByExpr::evaluate_on_groups_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, match/switch 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0acecf94840fa9329fc9ab75d5d6bbaf9b44e186583d51f7d9e760ee928cc7a"}},{"ruleId":"D2","level":"warning","message":{"text":"EvictionManager::run_in_background (cognitive 24): EvictionManager::run_in_background has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"crates/polars-io/src/file_cache/eviction.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"439fbf80bf00e6394f11127f996285c52f16745bc7e6d4bf72f6b2d6dfd0f173"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::utils::decompress_impl (cognitive 24): polars_io::csv::read::utils::decompress_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/utils.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a4620fd77c86dd6471ce7aebcc5dea31e26ffa3ed90e95c4d9ba78ba50985"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::binning::bins_from_rank_cuts_select (cognitive 24): polars_ops::series::ops::binning::bins_from_rank_cuts_select has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 8 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/binning.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aec56b228eec16ee658086501c5cfe924a0fb0301c3f83ed1cfedaa812df5c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::index::convert_and_bound_idx_ca (cognitive 24): polars_ops::series::ops::index::convert_and_bound_idx_ca has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/index.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7371baedef19a5ba82eb23f9baf437f3c8dddaee4892256258f4cde642ef144"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::required::decode (cognitive 24): polars_parquet::arrow::read::deserialize::dictionary_encoded::required::decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a686404749371ae50b7e1fab3feb197cda39d2d0a90aa5a3268dfab1dc47838"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionIR::eq (cognitive 24): FunctionIR::eq has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/equality.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f5fa64f1b290de7a27b4f5ccb0382de64ca51a10fe8f3f61873a594a71eca"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionIR::schema (cognitive 24): FunctionIR::schema has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (13 pts), loops 2 (7 pts), if/else 2 (4 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/schema.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbb87c087acdd15ded3b7b10b461ce9eaa6ae6541155ef74f1d6970bdecd56c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleProjectionAndCollapse::optimize_plan (cognitive 24): SimpleProjectionAndCollapse::optimize_plan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/collapse_and_project.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"810de4ccc9935aab2eb48a399a99c5bf60c936aadec9a3f69d154fd5cd74a1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeTraversalImpl::traverse_rec (cognitive 24): TreeTraversalImpl::traverse_rec has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/traversal/tree_traversal.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fb3099de3002f56ab669def1ab0a257c237478621208423133621ae6da37a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::dsl::datatype_expr::into_datatype_impl (cognitive 24): polars_plan::dsl::datatype_expr::into_datatype_impl has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 4 (9 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/datatype_expr.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6db8e9f52842caafa5fde5d5e1a61b34d20d685f3bc1c0c7157b273b9ce146"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::execute_create_table (cognitive 24): SQLContext::execute_create_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (8 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5750}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eed44af19e6a3c2760ce774cb8d51a3016b256e3f02ec5069f30ccef537f28"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_order_by (cognitive 24): SQLContext::process_order_by has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053aa1dc7cac3d1265253100077af54470bd163b6e0494c91b98a7b82d0620d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeOutput::probe (cognitive 24): ProbeOutput::probe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c9d32df56af891a1d03a3b316d837becd4920ad69435fe4ea64ca2fa83100"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferedStream::reinsert (cognitive 24): BufferedStream::reinsert has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3008b51595f84585ea123b0a137535d8e29bd139e3fc9ffdf059e0e9c4313d57"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::scalar_window::reduce_partitions (cognitive 24): polars_stream::nodes::scalar_window::reduce_partitions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 7 (11 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/scalar_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7bea9140e0546b3db6ab8179177ec217cc6f0e2c6b5e491a5e5f25efd83bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe._post_apply_columns (cognitive 24): dataframe._post_apply_columns has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"055c934667e731714596f50b8ca71f16c3d5ac988b9d6bb8d876874829f62b92"}},{"ruleId":"D2","level":"warning","message":{"text":"RewrittenInstructions._rewrite_methods (cognitive 24): RewrittenInstructions._rewrite_methods has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d98eabd510d2cbe050c032f9bc11589d631b1ba5a58c50e707d9fa3169f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"various._get_stack_locals (cognitive 24): various._get_stack_locals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f557a406ac6c1419f9454b833df392592520b98a85583c0bc76bb2dd8baefb9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::cast::cast (cognitive 23): polars_compute::cast::cast has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 12 (22 pts), if/else 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f3c6f096afda573be64da4524ca3ffba3799e9a045af4aa51124c3dc8254a"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudOptions::from_untyped_config (cognitive 23): CloudOptions::from_untyped_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"202fb38adbb3d2e0c2bf81dab62794f2f69f2c04d6f7979d9f7e56a048a27d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_json::json::deserialize::deserialize_struct (cognitive 23): polars_json::json::deserialize::deserialize_struct has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2924e791a6e64cd97c5797316affd1d4577c4e73bd0eda979836fb1e111435e3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::hash_join::single_keys_outer::probe_outer (cognitive 23): polars_ops::frame::join::hash_join::single_keys_outer::probe_outer has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_outer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4eba242477a143770acc9d90fabf8988dac71db963bb765a32e65843225f64"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::unique::unique_counts (cognitive 23): polars_ops::series::ops::unique::unique_counts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/unique.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"509eeffe80357fcec633d1b4740ad5bb1439dd129b6f7d967fd0d7e9518a7139"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::various::is_sorted_impl (cognitive 23): polars_ops::series::ops::various::is_sorted_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, match/switch 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":"crates/polars-ops/src/series/ops/various.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"759010b7f39b971987c8ec8ab52e5cf4b2b8d3f266d192cb42bb730049a29d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive (cognitive 23): polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"76885e43d11bc67a6dc82b654df745604bf4a488cbb91ba3e9c52d963084047a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::nested_utils::decode_nested (cognitive 23): polars_parquet::arrow::read::deserialize::nested_utils::decode_nested has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"25432c3e79cb75ae0dc16a08ba9ac04f89479596a0df81ed992b16375109e0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::schema::get_struct_numeric_dtype (cognitive 23): polars_plan::plans::aexpr::schema::get_struct_numeric_dtype has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"858924b3a2c1bc86d6fd637b406ec1bc08c17ac2ebebbc5596534f2507ee460b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::sql::trunc_arith (cognitive 23): polars_plan::plans::conversion::dsl_to_ir::sql::trunc_arith has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d247df3354a545e682cb024aa1a28fded4bec2ce93803f981074e18859a15e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::to_description::ir_props (cognitive 23): polars_plan::plans::to_description::ir_props has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d71709354617a606c1e378d33b34a01f1dac76448c18b125c3abc816ade06a"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeJoinNode::update_state (cognitive 23): MergeJoinNode::update_state has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1 (3 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":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f2e27687a5d760c353794b71c892dd52a3031139bd7c6d9bdc71878c0f6fac"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarWindowNode::spawn (cognitive 23): ScalarWindowNode::spawn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/scalar_window.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba510195831bd481e7770bffda1fbdeaccb1e2e0455fc95087271dee17664c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShiftState::shift_positive (cognitive 23): ShiftState::shift_positive has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/shift.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f74d49dc1ed0af4a2d4915df3840d7ac97ac4a3ecb2b71bdaf760e66b433535"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.scan_csv (cognitive 23): functions.scan_csv has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb858dea04fe00732c81d520d7d565c77f09017c4e0fd6fb96685ded337657ee"}},{"ruleId":"D2","level":"warning","message":{"text":"_sink._sort_key_exprs (cognitive 23): _sink._sort_key_exprs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6d7d838237cc0087c770e6d0c0db63fa82205e662c5ecf5d622a18793ec10f"}},{"ruleId":"D2","level":"warning","message":{"text":"IdentityTransformedPartitionValuesBuilder.__init__ (cognitive 23): IdentityTransformedPartitionValuesBuilder.__init__ has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 6, loops 4 (6 pts), error handling 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6743975086b7f804623d03b9521e765574f1c6e3b0b7b6adf7dd3162eb57bc"}},{"ruleId":"D2","level":"warning","message":{"text":"IdentityTransformedPartitionValuesBuilder.finish (cognitive 23): IdentityTransformedPartitionValuesBuilder.finish has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 4 (9 pts), error handling 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"31951cdae1ab2c91b2d44c7d028c3ee88ee4f96d3306cbb71ca4a2e749f78594"}},{"ruleId":"D2","level":"warning","message":{"text":"_write_utils._xl_setup_workbook (cognitive 23): _write_utils._xl_setup_workbook has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cd174d290bf58be673b4d96dabae149e9761d9ff0f9182837447760473ce25"}},{"ruleId":"D2","level":"warning","message":{"text":"context._insert_catalog_table (cognitive 23): context._insert_catalog_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, error handling 2, loops 2, ternaries 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3dd78a6f1b763ade369b73a8e51601bb04ea24a4ccd308d62752bc3e5474b3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::cast::cast_list_uint8_to_binary (cognitive 22): polars_compute::cast::cast_list_uint8_to_binary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad54fbbafc9f7dadbec72c4d4d4ee5c3ef05367e175f2114e7edf2f13378b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::filter::boolean::filter_boolean_kernel_sparse (cognitive 22): polars_compute::filter::boolean::filter_boolean_kernel_sparse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/filter/boolean.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac033249676bb3f33fa548e5dd8d95e2d8ae1c31c5d2ee50412c2ea8274f59ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::_try_from_arrow_unchecked_with_md (cognitive 22): Series::_try_from_arrow_unchecked_with_md has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (7 pts), loops 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":"crates/polars-core/src/series/from.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c8a5d4e4baf0c443baf66896e669f9f34a5c757923eef0ebe6cafb38aecda"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::shrink_type (cognitive 22): Series::shrink_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/eager.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc230b4bc383e6e9ff3f3c12b39d61011403d9e24b692ebee36e10f28fb0c21d"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryExpr::evaluate_impl (cognitive 22): TernaryExpr::evaluate_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7467b6da70f3917321c3f6156b62b5172e46e6dcc22525b282a7e689f54f7800"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedIndexTable::insert_key (cognitive 22): FixedIndexTable::insert_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (22 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/fixed_index_table.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aef7917531370daca95142186f7d526b5682a198fc2d0debe2a8aab404e517c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::packed_keys::encode_column (cognitive 22): polars_expr::packed_keys::encode_column has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/packed_keys.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df106705932ba6262ffb52e24360e7aadc9a73f43360d740b108ca5063ecae"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonScanExec::execute (cognitive 22): PythonScanExec::execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/scan/python_scan.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e0c91997a22a21b06e35d1cd1c911ac1e643ae546925d38c8cfedd99f6fa91"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::duration::impl_duration (cognitive 22): polars_ops::series::ops::duration::impl_duration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/duration.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d36c575a9a48f6965ca318cc0397825683121a8f4af52b4864c3bd7b2bb7236"}},{"ruleId":"D2","level":"warning","message":{"text":"PageDecoder::collect_flat (cognitive 22): PageDecoder::collect_flat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad369ebb64cf1e9e28bc1cadf5398828389ed983d7803720aa8fbe7f0334ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"Levels::extend (cognitive 22): Levels::extend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/nested/dremel/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f03d7e2f70fcd141dbd32ae9a4ebc0a24230250483da97634ba723966ee712"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::geo::geo_key_value (cognitive 22): polars_parquet::arrow::geo::geo_key_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/geo.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea056568632a70b947c31221eef59acb9ffb43b20f5d787526bf7b7b824c8226"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::from (cognitive 22): Canvas::from has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (8 pts), boolean chains 2 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52029548512168978b80566051be7e407037ccb35525c6a3ce15c21fbc1e49b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::aggregate_from_statistics::statistic_values (cognitive 22): polars_plan::plans::optimizer::aggregate_from_statistics::statistic_values has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 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":"crates/polars-plan/src/plans/optimizer/aggregate_from_statistics.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"855be58ed1f394e9143b8572b110fac60a9823149b1a4d11da755e1490c70019"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_pushthrough::candidate (cognitive 22): polars_plan::plans::optimizer::join_pushthrough::candidate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145870ee27e2fbb8062cb3c8a45edc8097afc7834e0e8e3792b87343cb6c29a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::stats::node::key_column_names (cognitive 22): polars_plan::plans::stats::node::key_column_names has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (8 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4544a5fa3d00e7a92bc6bd2757eb9a1fd943de6c5529802357670cd7d38af83"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_row::encode::get_encoder (cognitive 22): polars_row::encode::get_encoder has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), loops 2 (6 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"707b2a103b546ec692d1eedc5a04eb73c5177618f1c425f9e1b298ba2f6924cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::expr_or_ordinal (cognitive 22): SQLContext::expr_or_ordinal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (5 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d30b00f8b31f73c84ec1afb5ba75d2c30aa15f27e8c08ec78773338d79260d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_implicit_joins (cognitive 22): SQLContext::process_implicit_joins has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a21bd6f876b6742aa6b8793f4371b8d117cb6bc2d07a70b1b6530a52e3ea25"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::rewrite_subquery_conjuncts (cognitive 22): SQLContext::rewrite_subquery_conjuncts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0921200644c9dd6d93de5d63c5d7a50b8e6a94915ab38bf75186488a514e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"OuterJoinTree::covers (cognitive 22): OuterJoinTree::covers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73585fa366bb560faf9be4028c8905b1e9e4b28de36164b75e0b5a1f9dc9503"}},{"ruleId":"D2","level":"warning","message":{"text":"MorselResizePipeline::run (cognitive 22): MorselResizePipeline::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/morsel_resize_pipeline.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4119737f5039166a0eeb49ae25355c5b44b90529ecee3fc761e58cfc2a1266"}},{"ruleId":"D2","level":"warning","message":{"text":"UnorderedUnionNode::spawn (cognitive 22): UnorderedUnionNode::spawn has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (10 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/unordered_union.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"df73916308eb7aa8a582cc7956890aefc315be1ddaed3187ecc3037d2d22a213"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::equi_join::compute_payload_selector (cognitive 22): polars_stream::nodes::joins::equi_join::compute_payload_selector has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"154ec1d995bae491ff4cdb395a07950b33aaef0adaea1d3ddf69ae17282be86d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::range_join::compute_and_emit_task (cognitive 22): polars_stream::nodes::joins::range_join::compute_and_emit_task has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/range_join.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cf923794e9632b70577d610bfa084f6a04e448ed8821d2f10be9f5ec83d8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::merge_min_max_by (cognitive 22): polars_stream::physical_plan::lower_group_by::merge_min_max_by has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c751ea98305647ccabba2ff8fde3a1fadf8468e722d75e9c91afda0f9e3bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"RawTable::find_impl (cognitive 22): RawTable::find_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e883e03082b29aed9284b7625f3faf5ee0a69960fa2cd85bb587382ad191b348"}},{"ruleId":"D2","level":"warning","message":{"text":"dataframe._establish_dataclass_or_model_schema (cognitive 22): dataframe._establish_dataclass_or_model_schema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e41dfeaa94ae097c51f20830ac6602c2d8729aaf012e875c304327b04cfc76"}},{"ruleId":"D2","level":"warning","message":{"text":"getitem._convert_np_ndarray_to_indices (cognitive 22): getitem._convert_np_ndarray_to_indices has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, 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":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d34ba0e3e61fd2073c1d4aca0a31c66d0414e87b64b7351982c4a9660fc516"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.to_torch (cognitive 22): DataFrame.to_torch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (6 pts), boolean chains 5 (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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1246312419e93780dbd5676656adddd83245d21c7fea0fdeeca7f8f3bc90d989"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_delta (cognitive 22): DataFrame.write_delta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, ternaries 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30bba37ebf23aa675d7b2291a0af84dffd9e6579894f0c8fb090c9ee4d8055c"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.read_ipc (cognitive 22): functions.read_ipc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/ipc/functions.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"69774cd4d38f303b50b51103de4463a803030222cb7bf96ba2e9b7ee15045ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyFrame.sink_delta (cognitive 22): LazyFrame.sink_delta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, ternaries 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9830fa3b7da708620f27171d25fada21009a66b63b63f79ea9b054537eb87"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::try_steal_task (cognitive 21): Executor::try_steal_task has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (8 pts), match/switch 3 (8 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-async/src/executor/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ede763613b5f6b497ed32c7852f57b534c43b3217a523cb2c82a20bd5eff32"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::sort::arg_sort::arg_sort (cognitive 21): polars_core::chunked_array::ops::sort::arg_sort::arg_sort has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4f6e078e6e679aebe5f3ff255792b23fbcedc7e4da35f658c3694ef8919148"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_string::any_values_to_string_nonstrict::_write_any_value (cognitive 21): polars_core::series::any_value::any_values_to_string::any_values_to_string_nonstrict::_write_any_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"4657e42d4bd94d3676a23190381355cfdb65fc11ca5bfa112eaa9d2e6bdcb160"}},{"ruleId":"D2","level":"warning","message":{"text":"BinviewKeyIdxTable::probe_impl (cognitive 21): BinviewKeyIdxTable::probe_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"53709c3ca8f145d9ebfe749f485db79edb6442f5cec84c6eec1b78a6e9dcf2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Field::parse_bytes (cognitive 21): Utf8Field::parse_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a71873ca042b1128cd0fe6f6931e0c53682ec4445137121da6258732d53a59"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::parser::count_rows_from_reader_par (cognitive 21): polars_io::csv::read::parser::count_rows_from_reader_par has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"660511a9182acfd65c5180d0573f962fc91567da1dc8ad2af1ab72b9a6190ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::schema_inference::infer_file_schema_impl (cognitive 21): polars_io::csv::read::schema_inference::infer_file_schema_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6fcf74d0938aef82640a6e37bfcd58d7c60db967ac0c1bdd313fa2ee3aaa4b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::interpolation::interpolate::interpolate_impl (cognitive 21): polars_ops::series::ops::interpolation::interpolate::interpolate_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202ef34ade6c34b21f778f32db840ee7bd1d4368eddb19c3f519cc2c6ebf9a2"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::interpolation::interpolate_by::interpolate_impl_by_sorted (cognitive 21): polars_ops::series::ops::interpolation::interpolate_by::interpolate_impl_by_sorted has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf3b7a93c91e6a85cc51a9ec2478119dd23844ef10aacbb2c52517f17d2a02"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::geo::apply_geo_metadata (cognitive 21): polars_parquet::arrow::geo::apply_geo_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/geo.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd909ad005b7cbf33f01c6a44acd43be8b349a20ef6f0eab6d78bddb60f5fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::parquet::encoding::hybrid_rle::encoder::encode (cognitive 21): polars_parquet::parquet::encoding::hybrid_rle::encoder::encode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/hybrid_rle/encoder.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0224ca1f516dda02e1eadb07d1dfc89c1816c7742fa8358641a2ca2e7e7ae9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTypeSelector::fmt (cognitive 21): DataTypeSelector::fmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 2 (7 pts), match/switch 4 (7 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f1d044ce3ac61dd82230ce351f25a9e54b69df07f5cc0aca8f914f01084abb"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedArithmetic::optimize_expr (cognitive 21): FusedArithmetic::optimize_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/fused.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bde702f78348af578ef87a175d3474cf033359f4ca9fff01ffee949b81b245"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect (cognitive 21): Collector::collect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2429093bb93474e00571566292977987b95c0c3c84239ee97aa4c2fab2aade"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::can_cast_to_lossless (cognitive 21): polars_plan::plans::conversion::type_coercion::can_cast_to_lossless has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d63ad40d46c9b06cceed7be22a48813d736001c2bc9c3228eb15a1716315e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_order::enumerate::key_domain_product (cognitive 21): polars_plan::plans::optimizer::join_order::enumerate::key_domain_product has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/enumerate.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"663de7fdea6982673f9a90fe8f6d802b212489e314c4fa6bca36ad80130658f5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_pushthrough::pushdown_candidate (cognitive 21): polars_plan::plans::optimizer::join_pushthrough::pushdown_candidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 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":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9dc870e7986b96d7567cbb440ed6e3294a2f6bad6ee5190b81094d9fb67b24"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::function_expr_sortedness (cognitive 21): polars_plan::plans::optimizer::sortedness::function_expr_sortedness has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), boolean chains 2 (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":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"81709e6feaee0b34288e819325d479cdd461e218e5c8ce2fdd59d4b62d2b7424"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::schema::join_right_output_names (cognitive 21): polars_plan::plans::schema::join_right_output_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/schema.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"653a376b2e6026d03cf908e8ef1f5f67915b3b348f90390af2a7c3322d52406b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::sql_expr::resolve_compound_identifier (cognitive 21): polars_sql::sql_expr::resolve_compound_identifier has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45c57c9675e8d40d7d269b59734052dde068e2627f2f7b41b866091c66ec06e"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupByNode::spawn (cognitive 21): GroupByNode::spawn has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 2 (9 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"52de097a3c91554fd3a4a32eaa21f0786b9d7117b3106522de4c5d0a2ab7d16d"}},{"ruleId":"D2","level":"warning","message":{"text":"FlushState::new (cognitive 21): FlushState::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/flush.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4aa45ee558f8456b784b2751f3aaaf1bf1ce510f9cebc44a06d484255cb5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyFilter::from_builders (cognitive 21): KeyFilter::from_builders has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (7 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/runtime_filter.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb14c3937acc48c4e53ed7849b236445bf4aabe7ed70c76bf03a87bdb519143"}},{"ruleId":"D2","level":"warning","message":{"text":"RollingGroupBy::spawn (cognitive 21): RollingGroupBy::spawn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/rolling_group_by.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d27ea0970925a537aa6d70044b9d98faf7347a2e938c55b2d664575dbf8fa73"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingQuery::execute (cognitive 21): StreamingQuery::execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/skeleton.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40841607a8acd9370eca149d603135d49bdc3895fe20217f3b8ef5b3a5f0970"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::attach_reader_to_bridge::run_unordered (cognitive 21): polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::attach_reader_to_bridge::run_unordered has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/attach_reader_to_bridge.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f768ab92774ae738591ca2083f9a70d50f2cbf65cbaec3dcb0861ec70b0f46d4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::parquet::metadata_utils::read_parquet_metadata_bytes (cognitive 21): polars_stream::nodes::io_sources::parquet::metadata_utils::read_parquet_metadata_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/metadata_utils.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"89861a37695f8dd80639329a8e9d03cea001f2da34ba84e02fd34a1561126521"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::parquet::projection::resolve_pruned_fields (cognitive 21): polars_stream::nodes::io_sources::parquet::projection::resolve_pruned_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/projection.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9043fc8e437a4fffa60a9bcd4febbdef6061f8f76f98f5f9bb0f059a2cbae0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::merge_join::find_mergeable_task (cognitive 21): polars_stream::nodes::joins::merge_join::find_mergeable_task has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1ae4e82c330501eeebf890d82c36b93ad5938fa7893f8d7cdadcbd255b0fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr.__array_ufunc__ (cognitive 21): Expr.__array_ufunc__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts), boolean chains 1, ternaries 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":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f92c6ec5c5d99a60500ba10d3c15cb51db8390f3af587d19dbf30126fd5cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaSinkState._attach_resolved_sink (cognitive 21): DeltaSinkState._attach_resolved_sink has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281d4e52068e4186b9acae4d521fad841aad928197ecd5e76bd9bf88dd4b852"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._csv_buffer_to_frame (cognitive 21): functions._csv_buffer_to_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba03baf030c4b848bad81fc0094c3836df2838fb7a805dc51b715f23ca3f44a"}},{"ruleId":"D2","level":"warning","message":{"text":"context._create_catalog_table (cognitive 21): context._create_catalog_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, ternaries 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e7228693307db951df60ee2f992b54f179e0456677b6e89f6309df6b004f86"}},{"ruleId":"D2","level":"warning","message":{"text":"Sender::send (cognitive 20): Sender::send has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-async/src/primitives/distributor_channel.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7805cb321d24e2a44f2d2f53b5cf9e702829e5fdfc32c4646963a9c2d754a3"}},{"ruleId":"D2","level":"warning","message":{"text":"BooleanUnique::arg_unique (cognitive 20): BooleanUnique::arg_unique has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d5087b07e4d03f546edba859ce28ed1c9d3fccde44420390c977a66167e8ec"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::cast::cast_list_to_fixed_size_list (cognitive 20): polars_compute::cast::cast_list_to_fixed_size_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (10 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adced828ec111fd961c7a2c4abaf25beb4bc0c3835e6887e598a4770ee46804"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::cast::binview_to::try_binview_to_fixed_size_list (cognitive 20): polars_compute::cast::binview_to::try_binview_to_fixed_size_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (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":"crates/polars-compute/src/cast/binview_to.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef7d5abade62ff378487b64fe5e9fd39535c122404bb41998fe7cb9cebc44a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_sum (cognitive 20): ChunkedArray::agg_sum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eabcf72f18d17b9e0e31372c2c58c608e0ebe52c6ecf751969f0e1a1792c965"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesWrap::agg_var (cognitive 20): SeriesWrap::agg_var has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (SeriesWrap::agg_std) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c1a2d543acee676d09a72ed3ff6206100a2b7a28b21546dd5aa8f8b0ae45e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesWrap::agg_std (cognitive 20): SeriesWrap::agg_std has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (SeriesWrap::agg_var) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73819bf8c9896238497d85616e19c8059264b820fa01e7421db5ee95bfde47"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_array (cognitive 20): polars_core::series::any_value::any_values_to_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 2 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":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a280a865e1a0d01111e01a422304486df3be70a7239ea9110dccd4c7e2492e"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceExpr::evaluate_on_groups_impl (cognitive 20): SliceExpr::evaluate_on_groups_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 5 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ea8f2d05470717b5009ea6955f76c6b8fdacb59867a8497480ac0bbe0c6498"}},{"ruleId":"D2","level":"warning","message":{"text":"Regime::step (cognitive 20): Regime::step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/regime.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d81f3529517af08ecd4cc2913c51419fd58f945c427038f49569e86e625ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"CountLines::count (cognitive 20): CountLines::count has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec0fe83c2b6b409d5ba73d2f6f71069e16096b4f0e05c78d994f2b307da996d"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::try_get_metadata (cognitive 20): Inner::try_get_metadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/entry.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"448ea016a66c5dc6e2261920453af3a7eaf23a6a3b7bb7fbc5c7c85454545fab"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::functions::initialize_scan_predicate (cognitive 20): polars_mem_engine::scan_predicate::functions::initialize_scan_predicate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6e1e373961c7cf203d1539efe1cc81e8dbbc24f5175da0d0f6a9fb773cf05a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::iejoin::ie_join_impl_t (cognitive 20): polars_ops::frame::join::iejoin::ie_join_impl_t has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"683afdc2c6edb725e501e514f66f66a4e0ea654b8d3a4c8aab1d7879a5276597"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::index_of::index_of_value (cognitive 20): polars_ops::series::ops::index_of::index_of_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/index_of.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"739284b0be553fff18edcb0468485d36954c5cadf50e0e3560f73e962e1855f4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::interpolation::interpolate_by::interpolate_impl_by (cognitive 20): polars_ops::series::ops::interpolation::interpolate_by::interpolate_impl_by has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6abea290ea58d3972bb7bdbe4cc30f6f1deede651b515cdfabb3723b462a352"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::various::is_sorted_ca_num (cognitive 20): polars_ops::series::ops::various::is_sorted_ca_num has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/various.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5f779f8cd116b21996f8188b2d1378aed26932ac603c4d87e24e00f5f531a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::type_coercion::membership::resolve_needle (cognitive 20): polars_plan::plans::conversion::type_coercion::membership::resolve_needle has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (9 pts), boolean chains 6, if/else 3 (5 pts) (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/membership.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"914177439f376f130c4a3b6982901946f3b2df2c766e352af99eda7539f33512"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::projection_pushdown::field_pruning::recompute_schema (cognitive 20): polars_plan::plans::optimizer::projection_pushdown::field_pruning::recompute_schema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0059cfa246c3c8a4f6f3e8cf3d951703aef2e2e793ad2b1e147d9945a289f8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::string_addition_to_linear_concat (cognitive 20): polars_plan::plans::optimizer::simplify_expr::string_addition_to_linear_concat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54d13d4a48c4959c7f3cd4f503deb33b26f33f7bee48dcd093bd752cc8ebb8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::sortedness::aexpr_sortedness (cognitive 20): polars_plan::plans::optimizer::sortedness::aexpr_sortedness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ebc4da2eceee1dc6bd600518f5fc5fb14b3c3aea88acae101da60e73384626"}},{"ruleId":"D2","level":"warning","message":{"text":"PyLazyFrame::match_to_schema (cognitive 20): PyLazyFrame::match_to_schema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 4 (8 pts) (nesting depth added 4). None of this is in the body itself: all 20 points belong to 4 function items inside it that branch (parse_missing_columns, parse_missing_struct_fields, parse_extra_struct_fields, \u2026). 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":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c94fa5b835b1de6399826c1ce45e5cc83338b77d35e540a2de208481a79b972"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::conversion::any_value::py_object_to_any_value::get_list (cognitive 20): polars_python::conversion::any_value::py_object_to_any_value::get_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (polars_python::conversion::any_value::py_object_to_any_value::get_conversion_function) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9713fc7fc338725a8283a932d2df53f19cd47febf8a31bbd61e8f08a2c4ed04"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::register_ctes (cognitive 20): SQLContext::register_ctes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5ad565a13ac094afc28e85fe25cb9b08578a30b55391665fab9b084e9fb769"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_where (cognitive 20): SQLContext::process_where has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), loops 2 (4 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":"crates/polars-sql/src/context.rs"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9432c85f8d472dd006157003b5df50ca21c8a52a2e94a11c500ee812c2d7e3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::visit_case_when_then (cognitive 20): SQLExprVisitor::visit_case_when_then has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"7883348dfcf5d3e14a1591d2dac50268ad18439d602c167a39b8b4fe480965ed"}},{"ruleId":"D2","level":"warning","message":{"text":"PolarsTableFunctions::read_csv (cognitive 20): PolarsTableFunctions::read_csv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/table_functions.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79d3d04bb3ef8a6a93b7293db877da980d92072318f07b16640721908743f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::types::map_sql_dtype_to_polars (cognitive 20): polars_sql::types::map_sql_dtype_to_polars has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 2 (4 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":"crates/polars-sql/src/types.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28314bf04b3c87404c98cdd6ac7454dd9573c618e2b5715d55ed4f593d8301b"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiplexerNode::update_state (cognitive 20): MultiplexerNode::update_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/multiplexer.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc22fa74633071a8b148d0a9013e631ff3f40be3131b327bb41f5d1ec19b085"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowNode::spawn (cognitive 20): WindowNode::spawn has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 2 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b9e7e9ef50bd78a3d15e32b75e400d04c35dd545d3a021dc22b1e4f64ca7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipNode::update_state (cognitive 20): ZipNode::update_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/zip.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce88c688336124ad7782f8a2c91142a4dc3b99564d14a2e1721d99e686850dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::merge_join::compute_join_and_send (cognitive 20): polars_stream::nodes::joins::merge_join::compute_join_and_send has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b4551a0d24621b0be58f014855b91430c20af33971ed8a5cbab98758b0133d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::window::evaluate::evaluate (cognitive 20): polars_stream::nodes::window::evaluate::evaluate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/evaluate.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7fe284bdc0df61b0a793843f0a7076240e80ee58523e3ba4e1a8699b71e3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_time::windows::group_by::group_by_values (cognitive 20): polars_time::windows::group_by::group_by_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec67193bdfb76d69ad5896002d58337fe2b93ea07f546796f6ba5f3c941a34a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_utils::levenshtein::levenshtein (cognitive 20): polars_utils::levenshtein::levenshtein has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/levenshtein.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"917e912dcedd99d04943e204adc90a5378cbf8374bbf292c76eca79775984818"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.read_parquet (cognitive 20): functions.read_parquet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (20 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":"py-polars/src/polars/io/parquet/functions.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd925d5bba0a552c4b88af1a5f980bac58733b64c1ef2cf50153c4e99221f010"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._initialise_spreadsheet_parser (cognitive 20): functions._initialise_spreadsheet_parser has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e9c9b52980c5d3a62f019f91aea8fddbe2aeb6fff800df7d6b78ba5487a921"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.__init__ (cognitive 20): Series.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"791cd1255882eb77e82cbf321f8a04ccea9a2ba2b383945b9d8a6a02b210d20f"}},{"ruleId":"D2","level":"warning","message":{"text":"context._drop_catalog_table (cognitive 20): context._drop_catalog_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 2, 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c510a02de8354027557b41687c19558747c1ed7046c5bb6d4a3af988ef0859"}},{"ruleId":"D2","level":"warning","message":{"text":"data.data (cognitive 20): data.data has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8 (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":"py-polars/src/polars/testing/parametric/strategies/data.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2612c732a69acd10bde0a709f6f9d3755ab73cb8701bf4914e5dddd507b89ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"EwmCovState::update_iter (cognitive 19): EwmCovState::update_iter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/cov.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1138b9dd3d39b3212d003b0fbf47375b23eb9938726bdd3a0c26ae583cbdf938"}},{"ruleId":"D2","level":"warning","message":{"text":"BooleanUnique::n_unique_idx (cognitive 19): BooleanUnique::n_unique_idx has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4be05c9870480c4114bcceff5d14b71fcde620abbea702a5792998e765f144"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_max (cognitive 19): ChunkedArray::agg_max has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ce6fd7541cc704e33c04c7e182dad2afd5f710048fce3ed3a392d2a940f2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValue::strict_cast (cognitive 19): AnyValue::strict_cast has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 6 (9 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66f8cbc36258d969c793daed657530fea3e72109f7494fdb2f8df462b4b6773"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::fmt::fmt_duration_string (cognitive 19): polars_core::fmt::fmt_duration_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be6843222037c11648d61a589c0df71e6cbc4cd8007ed819ffee8fd722f5200"}},{"ruleId":"D2","level":"warning","message":{"text":"Ramp::round (cognitive 19): Ramp::round has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"429d365649248401404eaa218ac4359d6703c37c40b40fc9a34848424c706734"}},{"ruleId":"D2","level":"warning","message":{"text":"KneeController::step (cognitive 19): KneeController::step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece3c3a705bbe823d93ddefa73f5ec3d493c8738041494b1efcc2cb82d6ebf05"}},{"ruleId":"D2","level":"warning","message":{"text":"PolarsObjectStore::get_ranges_sort (cognitive 19): PolarsObjectStore::get_ranges_sort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/polars_object_store.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc0a3b6836ca657a2bd3e57635b6148878eacb39a07bf71c8f83265b9337ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::executors::projection_utils::execute_projection_cached_window_fns (cognitive 19): polars_mem_engine::executors::projection_utils::execute_projection_cached_window_fns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/projection_utils.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd489e24bd576c2ec26a16cac934ea5aa3a00f0428b4e1085834b3e1b9d5641"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryManager::spawn_spills (cognitive 19): MemoryManager::spawn_spills has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c844740637af793c921ed22a7d45497725e2d6bba174219c021fbb7b282463c3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::hist::get_breaks (cognitive 19): polars_ops::chunked_array::hist::get_breaks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 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":"crates/polars-ops/src/chunked_array/hist.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7c10282380425bcad7641e305d48bee043a9039024cbb5c1baaaf30e2ebcfd"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::scatter::scatter_binview_impl (cognitive 19): polars_ops::chunked_array::scatter::scatter_binview_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/scatter.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f3bf6174447e6df1a4a55b692ab8dd65809aef4c2ad4186e16cc9cc3d39743"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::asof::default::join_asof_impl (cognitive 19): polars_ops::frame::join::asof::default::join_asof_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/default.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56fd1af0323a68638e4ddfdd0feb59ae6d64f44dd8d1ed706b61893630bef6b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::parquet::encryption::decrypt::decrypt_column_metadata (cognitive 19): polars_parquet::parquet::encryption::decrypt::decrypt_column_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 pts), loops 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encryption/decrypt.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a286e2221ed91bcb36dc8c23713f2219f8a3aa8da54b127764e2c49c53a2d7ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnConstraints::resolve_deferred (cognitive 19): ColumnConstraints::resolve_deferred has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ec8e15b0a4255ce307a2a23bc381820563b1f53976be5b6d83738e32b6d1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"IRFunctionExpr::function_options (cognitive 19): IRFunctionExpr::function_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0a5bea1cb4e2e885e23de76613d42c32780c5db48060b3614aa1a876128f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprIR::from_node (cognitive 19): ExprIR::from_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/expr_ir.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b8058fbf3a5aa02d356aadba110d72261cc94442b5440d1ea39fced75e057"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonSubExprOptimizer::find_cse (cognitive 19): CommonSubExprOptimizer::find_cse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/csee.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"226d5dc0c01c6db624a4de5c815f160ad7772afeb1a7975385cf19e7d44c092d"}},{"ruleId":"D2","level":"warning","message":{"text":"PredicatePushDown::pushdown_and_continue (cognitive 19): PredicatePushDown::pushdown_and_continue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03b6e6755106254c0a2edb2a5f7364f9de40189f9aba959ea06415d84185321"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::filter_constraint::model_and_chain (cognitive 19): polars_plan::plans::aexpr::filter_constraint::model_and_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d044430bda61702e7c80e83e0481e8da552e1bf52f3365b6ac7473e2292f7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::aexpr::projection_height::aexpr_projection_height (cognitive 19): polars_plan::plans::aexpr::projection_height::aexpr_projection_height has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/projection_height.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f4d296c88931a1db44871529cd2d2997d1d2701f10df0e0143ac560d9baa9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::take_double_bounded_range_join_filter (cognitive 19): polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::take_double_bounded_range_join_filter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (5 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d31db7a419532f00901c925f0ffcb1c3c28f1cca6344612e242a3e6d2437d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_ternary (cognitive 19): polars_plan::plans::optimizer::simplify_expr::arity::simplify_ternary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85fe125816ada98bf87d9e5eaa5de756c574e799f262c075caaf01e2468ed1f"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::timeout::timeout_thread (cognitive 19): polars_python::timeout::timeout_thread has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/timeout.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa060064ffc725b1fd11503f292ac5d22adf87dd674f9677ea143171ed51631"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::subqueries_join_inputs (cognitive 19): SQLContext::subqueries_join_inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d75f5a7bc3a1ad947d87b505fe4161cbe8364f53d58ce97ca8252af0c0699b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::outer_select_item (cognitive 19): SQLContext::outer_select_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_outer_select.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9f23814ccdc3160e1beb033620db6ec19596b95c594412b3a5560418ba9f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::array_expr_to_series (cognitive 19): SQLExprVisitor::array_expr_to_series has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"83882097c20af3d4d9455a765f52b1b99ec18a530fd0a67cff9a2593aac6fe33"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::subquery::exists_aggregates (cognitive 19): polars_sql::subquery::exists_aggregates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (5 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"9051f18e95cbbba2a481ec156a999a217bd2b7afe9a2254013ad05309272eb10"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnarFunctionNode::update_state (cognitive 19): ColumnarFunctionNode::update_state has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 5 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/columnar_function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c9063af86390d945e43dc79b22b8db7d46af366f7013411e41b7e8266466c"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchFnReader::begin_read (cognitive 19): BatchFnReader::begin_read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (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":"crates/polars-stream/src/nodes/io_sources/batch.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"023712cd39fece0541edb36589c66ff7da54e150dffdf22ccf062b0f86512f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonFileReader::begin_read (cognitive 19): PythonFileReader::begin_read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/external_python/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d564ee72d85d8bc11d33b9df4677b3b9f4f5b9ad5a50c37487e364a59897f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetReadImpl::init_row_group_decoder (cognitive 19): ParquetReadImpl::init_row_group_decoder has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 3 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85178dcf424520935f00ae53f4fe09fed8c5ccd632fdb46ebf3f2c545482b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"PeakMinMaxNode::spawn (cognitive 19): PeakMinMaxNode::spawn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/peak_minmax.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad5f57840dd6ed960d1a1fa3bb1d17b7eeacf5d1d7fad268ee7162eda3ba282"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectNode::spawn (cognitive 19): SelectNode::spawn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/select.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b9ba507165f120b8ea88267eb8a714b1bc9654fc21f96503394e825642c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"BottomKWithPayload::add_df (cognitive 19): BottomKWithPayload::add_df has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f8a99c5877908b136a7fc2768e3f58a359108fed76d166a3bb42394f638f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Wrap::impl_group_by_dynamic (cognitive 19): Wrap::impl_group_by_dynamic has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/group_by/dynamic.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc095497f5cea65495a83ee3667a8fb182bdb43466f27642decaa779e7b0363c"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeParser.to_expression (cognitive 19): BytecodeParser.to_expression has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d3a1dc7f24b4c4314e228d7ccfbdb8195f1eb540a9c5e3ef8de0fd4d25b5c8"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergTableWrap._get (cognitive 19): IcebergTableWrap._get has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (9 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":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88a850b24941b431664b0c45cef27e42551cd496efe112504b61ab8b9dff396"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.filter_for_truncate_overflow (cognitive 19): _utils.filter_for_truncate_overflow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), error handling 1 (4 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":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb629bcb25f7181010d7c1b2591f998712116486ec2639f4aa811c137efae9"}},{"ruleId":"D2","level":"warning","message":{"text":"core.dataframes (cognitive 19): core.dataframes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, loops 1, ternaries 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":"py-polars/src/polars/testing/parametric/strategies/core.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ed55050c0cad261f52026c16d53870283c2071981b23fcce0e7cfc01cc0c20"}},{"ruleId":"D2","level":"warning","message":{"text":"dtype._parse_dtype_restrictions (cognitive 19): dtype._parse_dtype_restrictions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/dtype.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"da922ecd7b7d9ec42b8e545893d5bdce1479b43170f7974982d99e5497121ad0"}},{"ruleId":"D2","level":"warning","message":{"text":"dtype._instantiate_dtype (cognitive 19): dtype._instantiate_dtype has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 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":"py-polars/src/polars/testing/parametric/strategies/dtype.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e486cab0c47743aa5a4637301c90fad7a57da5b8b0d53e5547a2a9d9964f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::gather::sublist::list::sublist_get_indexes (cognitive 18): polars_compute::gather::sublist::list::sublist_get_indexes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/sublist/list.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"596836750266a12e529815b21eee40b13ff17f2e1ea852fe413674832e004e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::agg_min (cognitive 18): ChunkedArray::agg_min has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd07f242066c5d76053d591ea3eece59676a299dec1658653ad952f4c58433f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedArray::create_groups_from_sorted (cognitive 18): ChunkedArray::create_groups_from_sorted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/into_groups.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d228a0c32f3a29b9573fbfb7f58959008182dec73cd7fd33fd079b30367ada4f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataType::can_cast_to (cognitive 18): DataType::can_cast_to has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e5ccd5d6efbd49398e727f67d96d17a9dbd00108484f0c11160883ff84681f"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::cast_with_options (cognitive 18): Series::cast_with_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4, boolean chains 3, loops 1 (2 pts) (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4b1322a49f1715c59e5da22fe69e0f6dd5b58b33002811ebad13116d4c7a40"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::arg_min_max::arg_min_numeric_chunked (cognitive 18): polars_core::chunked_array::arg_min_max::arg_min_numeric_chunked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_core::chunked_array::arg_min_max::arg_max_numeric_chunked) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ee26053ffb49048b60a5b0a3e7d06a5c5ee627c72b27a38d1fce2b0a3cee10"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::arg_min_max::arg_max_numeric_chunked (cognitive 18): polars_core::chunked_array::arg_min_max::arg_max_numeric_chunked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_core::chunked_array::arg_min_max::arg_min_numeric_chunked) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc5d14ab659aa9e9ddb0f1fd4a308bea73dc3d6851d951ae3907249bb77b2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::temporal::conversion::get_strftime_format (cognitive 18): polars_core::chunked_array::temporal::conversion::get_strftime_format has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/conversion.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d8bddb5b4d14b09a2788a3fa89bbdced340084d26dcf64997a407a3a44bad1"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::utils::split_and_flatten (cognitive 18): polars_core::utils::split_and_flatten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7de681581b888a519fbd4de10e9382be2458aa564f8785edbff56d4d0f8b70f"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregationExpr::evaluate_impl (cognitive 18): AggregationExpr::evaluate_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe17642fc017ea19e18a3e8749263803bac4182d0f46b7582e939f8f4e9567ce"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyRowIdxTable::probe_impl (cognitive 18): KeyRowIdxTable::probe_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/key_rows.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"47055dfdcad388a663fbfe6e9c825e5bb95789b9227f95ae72c231baff4dd822"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueDisplay::fmt (cognitive 18): ValueDisplay::fmt has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), match/switch 2 (5 pts), if/else 1 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ndjson/buffer.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998d8caa7fae3f5cfc51dc03f5f48568bc6384772f2aef4da8dc54e16e5328a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::skip_lines_naive_from_compressed_reader (cognitive 18): polars_io::csv::read::streaming::skip_lines_naive_from_compressed_reader 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::skip_lines_naive) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"369d95d5af78c30479111a2c353e0335a127f01c041dfeb36766a6ad0b42b21e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::csv::read::streaming::skip_lines_naive (cognitive 18): polars_io::csv::read::streaming::skip_lines_naive 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. This shape REPEATS in the file: one other method here (polars_io::csv::read::streaming::skip_lines_naive_from_compressed_reader) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5bc0148fa471e9741482dfda505cbf905a94dac0b6d83b6e09f33521bc380d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::utils::other::update_row_counts2 (cognitive 18): polars_io::utils::other::update_row_counts2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (polars_io::utils::other::update_row_counts3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/other.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c244d4df8d67ba128a61638260f61f8a9799b1d4a159b6435954fa8d5fab2994"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::utils::other::update_row_counts3 (cognitive 18): polars_io::utils::other::update_row_counts3 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (polars_io::utils::other::update_row_counts2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/other.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8726bb55dd5a1e9d0d2f195237dd5ac6c6f7263dd3b26f4f2770f48eb35c3527"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryManager::find_spillables (cognitive 18): MemoryManager::find_spillables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, 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":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fedebcb7fdd5ca7207ca6c61689495722fa00c1ed27f6a525acb566be0922ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ListNameSpaceImpl::lst_gather_every (cognitive 18): ListNameSpaceImpl::lst_gather_every has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c06474506a45592c3091e938a634af229c9d8a7a291b04d4ad7b43e5911fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"AsofJoinNearestState::next (cognitive 18): AsofJoinNearestState::next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c64ad8c1a3f840ad08914dcc92c1dff06623e269f41c33f0e830dcc11d2a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::iejoin::iejoin_par_indices (cognitive 18): polars_ops::frame::join::iejoin::iejoin_par_indices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 2 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":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df0749834a8c685c9ad919433ec891ffc4c778297195809bec833d6eedb350c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::index_of::index_of (cognitive 18): polars_ops::series::ops::index_of::index_of has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/index_of.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b7a6c288e67902c4a7cd37485955ac19bd97eb6ef8943f4cdc09b22575ca74"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder::unspecialized_predicate_decode (cognitive 18): Decoder::unspecialized_predicate_decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b267c3ac567375dd38111fc6df79d2ebc354ea58bbc924630493c54632a45ab"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::write::slice_parquet_array (cognitive 18): polars_parquet::arrow::write::slice_parquet_array has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bda3a218e690b49fe45972d5984e76e3a9f32d6b8b14b49c1d117e0735cfaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeFmtNode::node_data (cognitive 18): TreeFmtNode::node_data 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":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117eb7defc459c73e25d8db6859d8b23d23e32dadb4f95f7ac52c3f34186c35"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeUnitSet::fmt (cognitive 18): TimeUnitSet::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1946d01f42ddeed5a61c02eb586e6a22f7cfa4b768fbe5c8952d20e9fb6add91"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::expand_datasets::expand_datasets_early (cognitive 18): polars_plan::plans::optimizer::expand_datasets::expand_datasets_early has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (5 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":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6960908f7fe4cb00e9fc0bcca8164063b10392255d0e638e85f481f0b0108326"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupingSets::aggregate (cognitive 18): GroupingSets::aggregate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/grouping_sets.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fadb5ae49f309655ecff3554ce9ebd56358c90193598879a4c371ff45e7bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::context::disambiguate_output_names (cognitive 18): polars_sql::context::disambiguate_output_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4c4c7c5e7c276f8f20c0570f291179fbaa5069603dadf8b4eb5114b19444f"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::grouping_sets::expand_grouping_sets (cognitive 18): polars_sql::grouping_sets::expand_grouping_sets has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/grouping_sets.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"53944961bc74e46ba244285e086693c629c7a1c6f673971186d9edd55c84cdaa"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyFilterBuilder::extend (cognitive 18): KeyFilterBuilder::extend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/runtime_filter.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"effefc004b14ce9cc90273ee176c1fa08e76d63452b5cdbfc459fcb0d9fc6f28"}},{"ruleId":"D2","level":"warning","message":{"text":"SemiAntiJoinNode::spawn (cognitive 18): SemiAntiJoinNode::spawn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0fc4bf939274a506ff11ba8f49d3d594eb1f7ecdbf4f57516191137c18660b"}},{"ruleId":"D2","level":"warning","message":{"text":"NegativeSliceNode::update_state (cognitive 18): NegativeSliceNode::update_state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/negative_slice.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0295061cef8f701107c69867d7884971286fec1af897c442d5820fd38c584c23"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::ipc::record_batch_data_fetch::spawn_group (cognitive 18): polars_stream::nodes::io_sources::ipc::record_batch_data_fetch::spawn_group has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5901bf1582f6889ce8210894a695bfd8249702cf987bf8e8fb38d2a7cda12b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::io_sources::parquet::passes::plan_passes (cognitive 18): polars_stream::nodes::io_sources::parquet::passes::plan_passes has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), boolean chains 4, if/else 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/passes.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7679a94fa14495e93d1605804e162fde705c0cb6a0293a9ef1d4654965604"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::merge_join::find_mergeable_partition (cognitive 18): polars_stream::nodes::joins::merge_join::find_mergeable_partition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c87e86635e02ac80890b3e41073776784171c70314dd258d8ee24593e139f5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_expr::is_input_independent_rec (cognitive 18): polars_stream::physical_plan::lower_expr::is_input_independent_rec has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 2 (4 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29d9255771a35934514502d0959eef95abbeb8cfcd5d1ed77dc9b4833248441"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeParser._inject_nesting (cognitive 18): BytecodeParser._inject_nesting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff8e0bbc9f339ea71f0aa0daee7d98561918a9885d8623aa9b2931126091193"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionTranslator._containment_kind (cognitive 18): InstructionTranslator._containment_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (4 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":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"85728e31d1a8e6dd3c9cbb93227f63f6357a84923edcb6779bbc80a4a7db68f7"}},{"ruleId":"D2","level":"warning","message":{"text":"various._cast_repr_strings_with_schema (cognitive 18): various._cast_repr_strings_with_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1, ternaries 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":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789fad365be718030a0eacf90e2ca935a890ca03bd968fc35d67f7b715c509e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.row (cognitive 18): DataFrame.row has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":11904}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee97a4b09c518b6ec5925d3e9f355d27fc27de31e92d01c0a1bb8391ce2e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionExecutor._from_rows (cognitive 18): ConnectionExecutor._from_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404f04db10c3ef670dd6ee8fe428b3c0e4c26b5b02cd0d5016d782f380dcc33"}},{"ruleId":"D2","level":"warning","message":{"text":"_plugin._catalog_storage_options (cognitive 18): _plugin._catalog_storage_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_plugin.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7247287358995f2aca45c82acad6f7d545a6c5a282794cf5193dc14121b8a65"}},{"ruleId":"D2","level":"warning","message":{"text":"_sink._partition_key_exprs (cognitive 18): _sink._partition_key_exprs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae768854ff79b3a4136ebeff0597f31706bac36017789859b0ad706d2bbdf50"}},{"ruleId":"D2","level":"warning","message":{"text":"_write_utils._xl_inject_dummy_table_columns (cognitive 18): _write_utils._xl_inject_dummy_table_columns has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac1f21c16981cbb17cc0dcd0452b0ff15323262a3297b742d48ed0a0f689234"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._get_read_options (cognitive 18): functions._get_read_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8 (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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce881ab6a72366e1498810f8a0c82593076114fd603b25c6a16f2e13c44cce0"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.expr_dispatch (cognitive 18): utils.expr_dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/utils.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b4ffe7c2d0702f7fcf2bc21bbd081976def4f942385d4b7bb4f8b3329babc6"}},{"ruleId":"D2","level":"warning","message":{"text":"context._drop_catalog_namespace (cognitive 18): context._drop_catalog_namespace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 4, boolean chains 1, 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7dd6128bdc3c906b628d94f26259b30c110404a999bc8be25f228ac5a70a68"}},{"ruleId":"D2","level":"warning","message":{"text":"context._assignable (cognitive 18): context._assignable has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"242bf28af0a58a28828fdf23104f371c5e9fa4722c8ef479f05135c1c9795147"}},{"ruleId":"D2","level":"warning","message":{"text":"DecimalFmtBuffer::format_dec128 (cognitive 17): DecimalFmtBuffer::format_dec128 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17aa548b0a3557f26d302ff78db266060445a961ef183fd2134d2bf7a79386"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::rolling::van_herk::van_herk_kernel (cognitive 17): polars_compute::rolling::van_herk::van_herk_kernel has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (7 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/van_herk.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbba37cd6e6d0d6aca62c9bbd62492f2aaeecad79d2eb5705560a4df68b202cd"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeZone::new_impl (cognitive 17): TimeZone::new_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/temporal/time_zone.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f83f53a63305dc9f04f5157aa3ac9636fe10abf504259b39e9c15569336c83"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame::group_by_with_series (cognitive 17): DataFrame::group_by_with_series has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2006b1978ae303c17336fa85da3a44fda0c0e3dc483a21947dda6fd9322854a"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::reshape_list (cognitive 17): Series::reshape_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/ops/reshape.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e2d0d8c7d3046b8c8eca542c616c8dc1ac2013ca419e98a8bb5b4b7f57a44a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::chunked_array::ops::sort::arg_sort::reverse_stable_no_nulls (cognitive 17): polars_core::chunked_array::ops::sort::arg_sort::reverse_stable_no_nulls has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43428ddeac4aaad8394b8778572dd4cced0513aa5c7a25abeb086e096e9a48d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::frame::chunks::chunk_df_for_writing (cognitive 17): polars_core::frame::chunks::chunk_df_for_writing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/chunks.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ceac41915b18698e2dc30a1da382c4f3f1665bed985c38159eb0496f62c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::frame::horizontal::concat_df_horizontal (cognitive 17): polars_core::frame::horizontal::concat_df_horizontal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/horizontal.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f428c616064a52ac2f0ad5c5b67a717883094e106926cd5074111e85998755cb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::frame::validation::ensure_names_unique (cognitive 17): polars_core::frame::validation::ensure_names_unique has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/validation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d4ccebe89370f1b63300e539ff50c5dad4edab47085cd56279d5e0ebb5bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregationExpr::evaluate_on_groups_impl (cognitive 17): AggregationExpr::evaluate_on_groups_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcddef4a4c4dba562a79f69577702600c7ec6c74bc5dd3c7093dd82c9e26a982"}},{"ruleId":"D2","level":"warning","message":{"text":"RollingExpr::evaluate_on_groups_impl (cognitive 17): RollingExpr::evaluate_on_groups_impl has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (5 pts), match/switch 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/rolling.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c41c541c09cb57c67bc0d700c21a9f2db512ef2bdec44211d6b622e41e509c"}},{"ruleId":"D2","level":"warning","message":{"text":"SortByExpr::evaluate_on_groups_impl (cognitive 17): SortByExpr::evaluate_on_groups_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/sortby.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9407f39a426425d6f6c749e4bef3db8356e4f281d5f4699ca193050217964a5"}},{"ruleId":"D2","level":"warning","message":{"text":"RowEncodedHashGrouper::probe_partitioned_groupers (cognitive 17): RowEncodedHashGrouper::probe_partitioned_groupers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/row_encoded.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33087725ac7fa7724e18e64bb4e8a6b158412837c10b35b3bce83a8f3d98b34"}},{"ruleId":"D2","level":"warning","message":{"text":"BinviewKeyIdxTable::insert_keys_subset (cognitive 17): BinviewKeyIdxTable::insert_keys_subset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3fc38c5e077193fa4aa88e74eca7646dc8fb4f83e159f5f3002a552ef38d43"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedKeys::escape (cognitive 17): PackedKeys::escape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 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":"crates/polars-expr/src/packed_keys.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"19891dd892dd689d17195cd29ac27f8707b17d6a63cfd622551c44c2cb1fdf59"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::dispatch::range::linear_space::linear_spaces_impl_broadcast (cognitive 17): polars_expr::dispatch::range::linear_space::linear_spaces_impl_broadcast has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ad8c4ca5c180913f1870546dcf59cbdd670caf9aababd0bd98bf90b9c10e44"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::dispatch::strings::replace_n (cognitive 17): polars_expr::dispatch::strings::replace_n has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae02fbab801aa13c4028dfba9d2bb82302e30d78255e014f5421f3c27fa6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::expressions::group_idx_per_value (cognitive 17): polars_expr::expressions::group_idx_per_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/mod.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b93c07668ec02a0d9c1f3d9877c0fc3fe8757a86d7c961f713ee80bdb0e833"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_expr::expressions::count::evaluate_count_on_ac (cognitive 17): polars_expr::expressions::count::evaluate_count_on_ac has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/count.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c3e2af571a619ecae52d2c86f92eff802f4b9cf244f04f8e795498e40cdd57"}},{"ruleId":"D2","level":"warning","message":{"text":"CachingResolver::resolve (cognitive 17): CachingResolver::resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/dns.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"980863326575f10866320fe46b2da9a309a278ab2a2646ea9a9ba951cad9beb7"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveRateController::settle_lazy_tick (cognitive 17): AdaptiveRateController::settle_lazy_tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (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":"crates/polars-io/src/cloud/http_rate_limit.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c476f7cc41e8467d6a11a61747a68d5509897032131e29927ee744c1e4bf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PolarsObjectStoreBuilder::build (cognitive 17): PolarsObjectStoreBuilder::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (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":"crates/polars-io/src/cloud/object_store_setup.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa405fdd0dcb8f0f07d0911135e0e4f77c245d9985c6cb2debe0622f7bfee5e"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcReader::finish (cognitive 17): IpcReader::finish 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). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ipc/ipc_file.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceb657ac9c23eb1707688fc73f2d57d478bcafa1dab978e1b7549b384ce9e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreJsonReader::parse_json (cognitive 17): CoreJsonReader::parse_json 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":"crates/polars-io/src/ndjson/core.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36866900083d3a0ed4baf9a968d9956bb69459867865564ddef08c352fe3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::scan_lines::split_lines_to_rows_impl (cognitive 17): polars_io::scan_lines::split_lines_to_rows_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/scan_lines.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9596c253ad5cce962710a44fe585c5e75a70aaf51c3dc412ddf0813f74a34981"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_io::shared::finish_reader (cognitive 17): polars_io::shared::finish_reader has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/shared.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe737d3b8884ea7af0c7885cc6cbdefe5603bc0bc2eda14c01fb36e2b8e2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::table_statistics::normalize_bounds (cognitive 17): polars_mem_engine::scan_predicate::table_statistics::normalize_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/table_statistics.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09c01442907c4c063b1e3370733af465033e8c50db3cdae27e4b3b516483aff"}},{"ruleId":"D2","level":"warning","message":{"text":"SpillCleaner::run (cognitive 17): SpillCleaner::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_file.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cefe8e9e55ceeb73111d7f98e5a694efddcbe5bb6c63bfd50e2439a7876cd24"}},{"ruleId":"D2","level":"warning","message":{"text":"SpillTokenInner::try_spill (cognitive 17): SpillTokenInner::try_spill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (17 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_token.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e165f9c7649c3777a17f7e872686d06b8aca9c6e63feee671b8ede2ddb3c422"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::nan_propagating_aggregate::group_nan_max (cognitive 17): polars_ops::chunked_array::nan_propagating_aggregate::group_nan_max has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (7 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_ops::chunked_array::nan_propagating_aggregate::group_nan_min) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b94ceef46f35f54848cff202525956fa914f981f7a7d578de68549070a804eb"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::chunked_array::nan_propagating_aggregate::group_nan_min (cognitive 17): polars_ops::chunked_array::nan_propagating_aggregate::group_nan_min has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (7 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (polars_ops::chunked_array::nan_propagating_aggregate::group_nan_max) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f310f2e52b4d59a3829a382c851283e5f35cf7993a55d89f4911d9d4388cbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"BinViewDecoder::initialize_predicate_equals_one_of (cognitive 17): BinViewDecoder::initialize_predicate_equals_one_of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (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":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd5bbbad230685b9e5cade2abdea7abb01f38f1323ea575be19868d3cf89c1"}},{"ruleId":"D2","level":"warning","message":{"text":"IntDecoder::evaluate_predicate (cognitive 17): IntDecoder::evaluate_predicate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5cea1e04736ab71de404704c23cdd5552ddc1144229d434886a5e0f467c110"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWriter::end (cognitive 17): FileWriter::end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/file.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caad1511d1c68a919d2e02f7f60e8a73133edcc2cd4262a02757c82c14b7029"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::binview::delta::decode_delta_length (cognitive 17): polars_parquet::arrow::read::deserialize::binview::delta::decode_delta_length has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dc063a8b2bb8f056005dc42adc42da284610fdd8394e52a959b96c0e53a91c"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_single (cognitive 17): polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_single has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_multiple) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86cf7a17de8fb1e78f09551d43b776986cba6f53dbe13df7f4c908bdf789e7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_multiple (cognitive 17): polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_multiple has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (polars_parquet::arrow::read::deserialize::dictionary_encoded::predicate::decode_single) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b7a276a544679f6f59a8f8ceec0bb87c35d425f0f6a1ec60efcafb8c52b7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::statistics::deserialize_all (cognitive 17): polars_parquet::arrow::read::statistics::deserialize_all has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), loops 2 (4 pts), if/else 1 (2 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/statistics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1659c9b5817066c13a35b2e29ebbe204c149f5961d9a3b64e6eccfe05e6e7a88"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::value (cognitive 17): Reader::value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/iceberg_properties.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9369c7a0738c0675124fef4d8c65001a8e84c3870848abf62edf5f7dcbb9c9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::draw_connections (cognitive 17): Canvas::draw_connections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"05eb6e58b151cb218eabb5a4accbc04d0a3f014fa8d718ed84326c485d8147b9"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::concat::convert_diagonal_concat (cognitive 17): polars_plan::plans::conversion::dsl_to_ir::concat::convert_diagonal_concat has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/concat.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"83decdd7348ff81136079435d686cb0470ac42e8775bd3de68852601cf54f5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::conversion::dsl_to_ir::scans::exact_int_ranges (cognitive 17): polars_plan::plans::conversion::dsl_to_ir::scans::exact_int_ranges has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3b584dda29f1673b09fcdd6f3445e6c0b3f6e4e3cd863c3f2cd4fc87b442f4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::cse::csee::classify (cognitive 17): polars_plan::plans::optimizer::cse::csee::classify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/csee.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae9c2b9d2aebe6033b1b0aaad729df94c37487d37ea0966f62e053e32e65ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::functions::lazy::lit (cognitive 17): polars_python::functions::lazy::lit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/lazy.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a457974f5466ac7c9424dc84ec0b62d9c91317a92475887b91ac562e5afc4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_python::series::scatter::scatter (cognitive 17): polars_python::series::scatter::scatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 4 (5 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/scatter.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b28361688e3ef2da2c1de597579121cffe27d7dfc648aa8f9f877627ac3955"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_row::variable::no_order::encode_view (cognitive 17): polars_row::variable::no_order::encode_view has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138c74962d3f63f87f487079c9012e4626884d7b81be665a116df413c11d8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_asof_join (cognitive 17): SQLContext::process_asof_join has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (5 pts), match/switch 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"038f062c1da85d08c83c1ef9e388c650c9fdc0d71b227297840aef38eb69b30e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLFunctionVisitor::visit_window_aggregate (cognitive 17): SQLFunctionVisitor::visit_window_aggregate has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8, if/else 5 (7 pts), boolean chains 2 (nesting depth added 2). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/window_frames.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdb1ec4672715a04663baa57271b6af6981c3f2b91f8210dec9c0f8371cc983"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprVisitor::visit_any_subquery (cognitive 17): SQLExprVisitor::visit_any_subquery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f11881360e717dfccae932ed102dc15d4e29357a1fa5111892ff4edc7349caa"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::join_keys::comparison_casts (cognitive 17): polars_sql::join_keys::comparison_casts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 3, 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":"crates/polars-sql/src/join_keys.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f9c27650fc8508c9f59c0ffe750eb9bdd1cdea96a39bfb4d1932a3cbc886f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatchDecoder::record_batch_data_to_df (cognitive 17): RecordBatchDecoder::record_batch_data_to_df has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_decode.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eee9ab2c8ae0608e78bc746e8c2ef755af4853d8e36fac0a58322c23d25b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyRowIndexOrLimit::run (cognitive 17): ApplyRowIndexOrLimit::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/row_index_limit_pass.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b45162f64f1c14bb06f17e6df50a0495aac68863f54c16428343db8221b87df"}},{"ruleId":"D2","level":"warning","message":{"text":"FlushState::next_step (cognitive 17): FlushState::next_step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/flush.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c888f43dae999c4a0506b32f733921cdd450eea1d9c2be13f3283f3d89e74c4"}},{"ruleId":"D2","level":"warning","message":{"text":"SortedGroupBy::spawn (cognitive 17): SortedGroupBy::spawn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 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":"crates/polars-stream/src/nodes/sorted_group_by.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"022363f4fb398f89232d6af90988ae58755a72717a75357a2648f6a781523dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::lower_group_by::try_build_sorted_group_by (cognitive 17): polars_stream::physical_plan::lower_group_by::try_build_sorted_group_by has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b62c156a9321b6de044eb074a3a033814461192cdea7ea487230a8988e61f6"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::split_select::split_pre_post_select_minsize_elementwise (cognitive 17): polars_stream::physical_plan::split_select::split_pre_post_select_minsize_elementwise has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/split_select.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a41c44d514fe85291bbcd243b154166d5b3bc05c56c6338e37d6da53637c3"}},{"ruleId":"D2","level":"warning","message":{"text":"RollingWindower::insert (cognitive 17): RollingWindower::insert has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3140953e71dc335177dec9af7b79f9811a2d4814e0992a2146d0c4754a3189"}},{"ruleId":"D2","level":"warning","message":{"text":"series.arrow_to_pyseries (cognitive 17): series.arrow_to_pyseries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (4 pts), boolean chains 1, ternaries 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":"py-polars/src/polars/_utils/construction/series.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"514ca4daef5aa1f6e0a7057ebe98db9026a3fb1bc06ac57456ff71805f7a5751"}},{"ruleId":"D2","level":"warning","message":{"text":"general.from_arrow (cognitive 17): general.from_arrow has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 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":"py-polars/src/polars/convert/general.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"52203ed0fde1ddc5f015699f9cb49ceb0b235b9df021e72547bb5752828a4708"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.__setitem__ (cognitive 17): DataFrame.__setitem__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"393f54a4aee35090eb495ac8c35fe2fb35654015381f95973ce68fa6c430b218"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.to_jax (cognitive 17): DataFrame.to_jax has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaec673bf18e9385798e01248d851435a0bcfb3a9f043dbfb8a3360502d779b"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.iter_rows (cognitive 17): DataFrame.iter_rows has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":12274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44df13cdd997c3cac61b320cf4a701ea85baf095a3fa0c0c1517eb5e80c7eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Col.__getattr__ (cognitive 17): Col.__getattr__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/col.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9db2313ec260ef22db65c12a1d68cb551cc8598c32da988822573462a83408"}},{"ruleId":"D2","level":"warning","message":{"text":"col._create_col (cognitive 17): col._create_col has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/col.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee7c861e20a614851947791bb9b3ba383517bb6ee317fcb13cb288132f9244c"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.predicate_to_pyiceberg_delete_filter (cognitive 17): _utils.predicate_to_pyiceberg_delete_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e67d0f097bb2b411a1697b27da7ed4a93f7c6852b2ccd09b78158b091279ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"functions.scan_iceberg (cognitive 17): functions.scan_iceberg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"py-polars/src/polars/io/iceberg/functions.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e259ba3c558e71258360e2a17407bfe496270a34231c293c58ac12ecf5e18c8"}},{"ruleId":"D2","level":"warning","message":{"text":"LanceFragmentReader.collect_batches (cognitive 17): LanceFragmentReader.collect_batches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3, loops 2, boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/lance/_reader.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"093b4f82239fb3b26c4cd0f43d97c52b94d883e6df3b1ba0d856b80d981d7ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._read_parquet_with_pyarrow (cognitive 17): functions._read_parquet_with_pyarrow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/parquet/functions.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff9e64c4d667319ede7fcb895c416abc3378bb50a2480caf755e0d91c26437"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._sources (cognitive 17): functions._sources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8b7fc08dfd52123013668031be31a859f678024f6ebdc515e51cb59e9eb38d"}},{"ruleId":"D2","level":"warning","message":{"text":"functions._drop_null_data (cognitive 17): functions._drop_null_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5005b5537192b841fbe4c71b826d465700506d43822163b8b96b10f3ea3d5c1"}},{"ruleId":"D2","level":"warning","message":{"text":"selectors._combine_as_selector (cognitive 17): selectors._combine_as_selector has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c1800381cb599e98135c84778c932f443980768cc7e30103c983274e5dafc0"}},{"ruleId":"D2","level":"warning","message":{"text":"context._merge_key_filter (cognitive 17): context._merge_key_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3b54db46f72a0f99fbd426f7973856ef37577eaae33ed12113ea1a4fd9d611"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::decimal::dec128_div_scaled (cognitive 16): polars_compute::decimal::dec128_div_scaled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37ddb5e7f71f83a458c397bd5fe17a92e7830811e12ff24974fcaba47d56bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::gather::primitive::take_values_and_validity_unchecked (cognitive 16): polars_compute::gather::primitive::take_values_and_validity_unchecked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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":"crates/polars-compute/src/gather/primitive.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee8fe0a3e6374c72e11055e52b071711b3d0a35bf35cc23e9e9906724bca3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_compute::propagate_nulls::propagate_nulls_struct (cognitive 16): polars_compute::propagate_nulls::propagate_nulls_struct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/propagate_nulls.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"727a832fe7a420311c8b84690b018299ea661027df64bd247e44291f04384295"}},{"ruleId":"D2","level":"warning","message":{"text":"DataType::try_to_arrow (cognitive 16): DataType::try_to_arrow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff444d465690f11bb838932dc80f2bef36a0b66114c1b1a0a7203e4100fffc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Column::arg_sort (cognitive 16): Column::arg_sort has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 2). Of this number, 8 points are the body\u0027s own statements and 8 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":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178b1461e66ee1a842a39ff061c86b6860d9cfbb88ce7edc69a5cd4fc26cad6"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericFixedSizeListOpHelper::_finish_impl (cognitive 16): NumericFixedSizeListOpHelper::_finish_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cf0162caa7abc0a616dd739541ece35227e2f73061545df1f219e693fb1bba"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericOp::apply_array_to_scalar (cognitive 16): NumericOp::apply_array_to_scalar 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":"crates/polars-core/src/series/arithmetic/list_utils.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceb19c185669d438d107957f38dc695429347991eb1cf09c81b113a7a1c7102"}},{"ruleId":"D2","level":"warning","message":{"text":"ToArrowConverter::attach_pl_field_metadata (cognitive 16): ToArrowConverter::attach_pl_field_metadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (inner). 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":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"78846e8f33ef2bedcc90648cc5f57de13d409e3d43b93e0405b88f39de973503"}},{"ruleId":"D2","level":"warning","message":{"text":"Series::from_any_values (cognitive 16): Series::from_any_values has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b412f3d0f65387cd0288e56e35bb3737c8ea0a2313f04f173e50d2704f5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::frame::row::transpose::numeric_transpose (cognitive 16): polars_core::frame::row::transpose::numeric_transpose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/transpose.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c0f2e02be1b2ad15014bc117b0deb4b296348b0f01d68d7e94427f269bd415"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_decimal (cognitive 16): polars_core::series::any_value::any_values_to_decimal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"343bc580d64e9ffadc6bb96d146963e1978745eff6b05bdd1119b93434afafdf"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_core::series::any_value::any_values_to_struct (cognitive 16): polars_core::series::any_value::any_values_to_struct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7675a66f636d75e17260e7cad3a43d02f522f4c31aac60f126a2568e0b8fb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyRowLayout::verify_columns (cognitive 16): KeyRowLayout::verify_columns has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/key_rows/layout.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f7204775693b7b09f19df914ad7160681d6a3b87b2b872719025741d2e0eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyRowLayout::write_columns_batch (cognitive 16): KeyRowLayout::write_columns_batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/key_rows/layout.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"04deedfce3d801d858a6cd560605e95f282cedb44aed7774d12fb3f61becb24e"}},{"ruleId":"D2","level":"warning","message":{"text":"CovGroupedReduction::update_groups_while_evicting (cognitive 16): CovGroupedReduction::update_groups_while_evicting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (PearsonCorrGroupedReduction::update_groups_while_evicting) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"48962850124a746fef0883cda56f4f8d044c153a96d7d417f5cf73133936a3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"PearsonCorrGroupedReduction::update_groups_while_evicting (cognitive 16): PearsonCorrGroupedReduction::update_groups_while_evicting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CovGroupedReduction::update_groups_while_evicting) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0918063393c492925417b7600fdd82e2839a574eee0638e9d1225dc91bd0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"NumSumReducer::reduce_ca (cognitive 16): NumSumReducer::reduce_ca has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 4 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/sum.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d3ba64a910de3546b12876a8802ec32773dca26fb4b702ecb5ac0531e5f941"}},{"ruleId":"D2","level":"warning","message":{"text":"KneeController::end_round (cognitive 16): KneeController::end_round has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be43f794b3dc944bdd11470b2760a157c33832bdb96d39854ad29fa86e12dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"EvictionCandidate::try_evict (cognitive 16): EvictionCandidate::try_evict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/eviction.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"079bc98f95383dbadf750ae985fa453cd0783e4715ef672e8d0c1f7f1dbb1584"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_mem_engine::scan_predicate::functions::filter_scan_ir (cognitive 16): polars_mem_engine::scan_predicate::functions::filter_scan_ir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e274aaedccd2ff8e7c0e36a6b0d0010e87e14438c0c3c634db1600a4a378b04b"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::dispatch_left_right::materialize_left_join_from_series (cognitive 16): polars_ops::frame::join::dispatch_left_right::materialize_left_join_from_series has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/dispatch_left_right.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"985c779582ea670b8fa944cdf8db5940f2ceb3d103def9a6ad4c4262d86e79a7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::frame::join::merge_sorted::get_merge_indicator (cognitive 16): polars_ops::frame::join::merge_sorted::get_merge_indicator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_sorted.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b9effb21f82cf429a645b140a1ea5426c95a063a5c0e72eadf0d6bfa3bb61"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::business::add_business_days (cognitive 16): polars_ops::series::ops::business::add_business_days has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/business.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50152da5a820f20c11d52225d13907630aeda7bb7e84d91549c564dc160c917"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::is_first_distinct::is_first_distinct_boolean (cognitive 16): polars_ops::series::ops::is_first_distinct::is_first_distinct_boolean has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281e8d8278b845bb5479ea0dedb65b016934a5b57fa4bdf56c98f60161d999a"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_ops::series::ops::is_last_distinct::is_last_distinct_boolean (cognitive 16): polars_ops::series::ops::is_last_distinct::is_last_distinct_boolean has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_last_distinct.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92537bbeb3f84b4c50297b3a29b861c09e992fd46dc20fbe553d5c307c6562f"}},{"ruleId":"D2","level":"warning","message":{"text":"Decompress::read_copy (cognitive 16): Decompress::read_copy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/snappy.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b18c1fde858d938461366d989554aa93d764df3d8369afc585ab22e5db5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::primitive::plain::decode_masked_optional (cognitive 16): polars_parquet::arrow::read::deserialize::primitive::plain::decode_masked_optional has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/plain/mod.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4bb0c0224921b69b4f3b1f8299d451aceb132fb925996c3b75cec1dcf7fad7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::arrow::read::deserialize::simple::page_iter_to_array (cognitive 16): polars_parquet::arrow::read::deserialize::simple::page_iter_to_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77f093326e48e4db9c8fcee90e9c79cb7b45e258ab2417363209e627e041bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_parquet::parquet::write::file::encrypt_column_metadata (cognitive 16): polars_parquet::parquet::write::file::encrypt_column_metadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/file.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"97569c5522deb7c29144bf3271e98caa51a0fbdbf95abd0130597a816bb74d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataPerSource::gather_reindex (cognitive 16): MetadataPerSource::gather_reindex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 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":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"33efb981f3d55f6de330b6f4336a741d0d31f0aaf9528768b977c93298328297"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector::into_columns (cognitive 16): Selector::into_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd8eaee3ca3f9db8d3e714dd933964f27a7eeedb0dcc5d191ef3d98a887343d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::join_build_side::set_join_build_sides (cognitive 16): polars_plan::plans::optimizer::join_build_side::set_join_build_sides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_build_side.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4436a6f1b7477761b83531d5eb0e8ed8ac7f3e077a6b414305c657b4644643"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::recursive_caches::cache_parts (cognitive 16): polars_plan::plans::optimizer::recursive_caches::cache_parts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/recursive_caches.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"db69b029f00e3798772ebf05e549688e54bd49d0ffa5ef10bd1e9238d211d9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::column_with_literal (cognitive 16): polars_plan::plans::optimizer::simplify_expr::column_with_literal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a152b5afa46b5a1416fb960e7936a85cc6b32e23421abf610b52a2be37e1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_expr::arity::simplify_repeated_operand (cognitive 16): polars_plan::plans::optimizer::simplify_expr::arity::simplify_repeated_operand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb16ad2c293444b34c5444708c955a9bec4feb9998a350edb6dd6b29fa83410d"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_plan::plans::optimizer::simplify_ordering::ir_graph::build_ir_traversal_graph (cognitive 16): polars_plan::plans::optimizer::simplify_ordering::ir_graph::build_ir_traversal_graph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/ir_graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"608578c889465bf77bb1f0f4d1cfec84884733d12de4ffbe0f443e7f5c7fb9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Wrap::extract (cognitive 16): Wrap::extract has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"526d0ab97ea3d652819f3c5c9e7480034089b650aeea5a5632d28c7c68a392ca"}},{"ruleId":"D2","level":"warning","message":{"text":"PyDataFrame::from_dicts (cognitive 16): PyDataFrame::from_dicts has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/dataframe/construction.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6a080d52f59ea790f08aa703ce626cc917afd3134e8588791e2d6b9ce73c1"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::record_joined_aliases (cognitive 16): SQLContext::record_joined_aliases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"0032116b0fbc4f81e5760f3543cebc01c7947c8b1045fbe5728f31e0b41ac3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::process_except_intersect (cognitive 16): SQLContext::process_except_intersect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a568dc298a16c959fc60947d5b6834d9068c2153378d7e58f95b6f1a03fe79"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::execute_recursive_cte (cognitive 16): SQLContext::execute_recursive_cte has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a440bc062ebf542d430200614a868c719dafb397498bf9e7fb5f6ee026863"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLContext::try_decorrelate_exists_subquery (cognitive 16): SQLContext::try_decorrelate_exists_subquery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fbc691b7a7e1912f8832095c88e2dc987f496fd6691d8fd2ebdcce69d486b2"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_sql::sql_expr::cast_literal_series (cognitive 16): polars_sql::sql_expr::cast_literal_series has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e43463ecf29dc8f16061249ba828adf28c04d2995b343197340fc36da844626"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetSinkMorselSize::build_part_sizes_iter (cognitive 16): TargetSinkMorselSize::build_part_sizes_iter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/size.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a42dd1f9217d19e699d64bba8ff3cdf520275923506e688a42ea6945b63c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBatchProducer::next_batch (cognitive 16): LineBatchProducer::next_batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5876f918d9136ed9c02c2048760691264e70739374adb6b4aaa562fa30cd8444"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetFileReader::begin_read (cognitive 16): ParquetFileReader::begin_read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cef5c6907542bcc9936b00bb35b941c5b92aea226c7793764a8a39ba5b8dade"}},{"ruleId":"D2","level":"warning","message":{"text":"RowGroupDataFetcher::next (cognitive 16): RowGroupDataFetcher::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_data_fetch.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8ce8b69f30bb1e97a2787d7dd84c40099dfeddc7a6ab3d72a9203121049fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Pass::decode (cognitive 16): Pass::decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cbf5855167604dd3dc9f1a82d5f622b736248dff6683f5b25cd064f9150eac"}},{"ruleId":"D2","level":"warning","message":{"text":"AsOfJoinNode::update_state (cognitive 16): AsOfJoinNode::update_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc53fb36b2505fa1642b37f813f1088d4493ee742d7f1ae545f53047c2a6bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"EquiJoinNode::new (cognitive 16): EquiJoinNode::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf5e779c84adfc8e91a554f6d19977c2105550ef0a7b2077e1ca91d081273c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeState::partition_and_probe (cognitive 16): ProbeState::partition_and_probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3cb7717166241b68ad096041c1a5b6bcc98e489857c3d62473ccd0cf1d4b28"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeSortedNode::update_state (cognitive 16): MergeSortedNode::update_state has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9024135e1a5667fae2a3be6fc794602ca07b1a87513a8518b4178901d7606a1"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowNode::update_state (cognitive 16): WindowNode::update_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/mod.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d187dd4475643e3ba9928e2859bef178ff587b26b0740a0b88ddc813e60f20"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::nodes::joins::asof_join::compute_asof_join (cognitive 16): polars_stream::nodes::joins::asof_join::compute_asof_join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e589ae02e0ff7cae4293d616ece54adffe4ce4d9c54faebc9929297062f8bbf0"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_stream::physical_plan::fuse_drops (cognitive 16): polars_stream::physical_plan::fuse_drops has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa690f505006cc03fdacc9f1a96b7e1bc24132fc7a9bb91bd5388b3852acd87e"}},{"ruleId":"D2","level":"warning","message":{"text":"polars_testing::asserts::utils::assert_series_values_equal (cognitive 16): polars_testing::asserts::utils::assert_series_values_equal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-testing/src/asserts/utils.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bc7e0dc98483e2a389669c4d2b67c1ecc8332073969774bb969ee3ffbaad1d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.glimpse (cognitive 16): DataFrame.glimpse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":5861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66fe1375df06fb26f10b007b6fd34144265c73474a436f9235adf07e12a46fe"}},{"ruleId":"D2","level":"warning","message":{"text":"_sink._delta_dtype (cognitive 16): _sink._delta_dtype has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0db1bb7f0266ed743d24b69e8bf93eca2f90b5984b417692126b106de4c12f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyFrame.join_asof (cognitive 16): LazyFrame.join_asof has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 3 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e38095c68d46ff293da78bb41590322f4f715ff5a6985446d6919fc76aadf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx: FunctionTooLong \u2014 polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx runs 1681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1581 over it, 16.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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2689904b8a220d6c902bda63943cac344efa9f8a810c3c42841a63f8665e10d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::to_graph::to_graph_rec: FunctionTooLong \u2014 polars_stream::physical_plan::to_graph::to_graph_rec runs 1540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1440 over it, 15.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13d9d94b5ebe1729bea724262febe9632ba39927dde84af276dd68ecf677c11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectionPushdownVisitor.pushdown: MethodTooLong \u2014 pushdown runs 1483 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1383 over it, 14.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"505cca47472b15059185a0d5d7e5b94b3d6ce4955c64835e594af9b1d4295f03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyExpr: TooManyMethods \u2014 442 methods, declared across 15 files: expr/general.rs (190), expr/string.rs (55), expr/datetime.rs (43), expr/list.rs (31), \u002B11 more file(s). The bar is 30 methods; this is 412 over it, 14.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41b92df969509aa3b46dc7046860cec492db904b4714207bb21e9a7b8b9524e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_ir::lower_ir_inner: FunctionTooLong \u2014 polars_stream::physical_plan::lower_ir::lower_ir_inner runs 1415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1315 over it, 14.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d9ef9cbb2f16ed3f6d91491eb732739c05c74dc3782b50285c294dc41114f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 6497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: SQLContext (5 blocks, 316-6986), declaring 83 free functions. The bar is 500 significant lines; this is 5997 over it, 12.99\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce6be4e68776a961d2094835a2f18ebdb6cc3147fb954bca924bd8d153356cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySeries: TooManyMethods \u2014 372 methods, declared across 13 files: series/arithmetic.rs (119), series/comparison.rs (96), series/general.rs (75), series/construction.rs (36), \u002B9 more file(s). The bar is 30 methods; this is 342 over it, 12.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d379c2f35f7e5560c8c57dd8019e3a4bac080b00ac4a2434ed6af785c3eb0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions runs 1216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1116 over it, 12.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c717277e3d76e7092875c37a0d4e04eface5a8c4a5f6bbaaecfe4a009e0e385"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::lazyframe::visitor::expr_nodes::into_py: FunctionTooLong \u2014 polars_python::lazyframe::visitor::expr_nodes::into_py runs 1209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1109 over it, 12.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"7415323513a4484f7a2d56535c3a9191007bdf98632572df57be9baf836514c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SQLContext: ClassTooLong \u2014 4650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 187 methods, 5 blocks, lines 316-6986. The bar is 400 significant lines; this is 4250 over it, 11.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"543dea09cf018910ee656495aa127de73bbfcf03ac38073c2094d5b1f1fb5d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::to_alp_impl: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::to_alp_impl runs 1103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1003 over it, 11.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"494bac73dad8186495b32687e9dbfc2b09a66b11d662f9ba7643f0bf74215baf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series: TooManyMethods \u2014 317 methods. The bar is 30 methods; this is 287 over it, 10.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":"py-polars/src/polars/series/series.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62a157b5a8e3ea0b40a7663a60ab06222c845225690fad1804b2e7d67a1608c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: series/series.py: FileTooLong \u2014 5250 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4750 over it, 10.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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff106c72653383305518d71346fb2e80d25debf2927a650c956698d8c65bbae6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataframe/frame.py: FileTooLong \u2014 4493 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3993 over it, 8.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c377dc5048eb7b44727b632552c7e2a8a7b50eb7cc5a843e36a68398aa8d2e27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl: FunctionTooLong \u2014 polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl runs 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 782 over it, 8.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa4edaae712507c02b8831e61306d5f15311de6cddd58103e905f8fce7f9b01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCoercionRule.optimize_expr: MethodTooLong \u2014 optimize_expr runs 881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 781 over it, 8.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":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0c89b292e759782214c9bcab124c0370cae463d127144f5b1ddb12586789e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 259 methods, declared across 8 files: dsl/mod.rs (188), dsl/arithmetic.rs (23), expr/mod.rs (18), dsl/statistics.rs (12), \u002B4 more file(s). The bar is 30 methods; this is 229 over it, 8.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/expr/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02e7360846b30df0d3ed3010180070bf997996d6bd160984dca6e57e709b40e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 257 methods. The bar is 30 methods; this is 227 over it, 8.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":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae95ef95e5d53742faa3520d2b8471f872e200df9fb2c892c8cfa39befcbccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::to_description::phys_props: FunctionTooLong \u2014 polars_stream::physical_plan::to_description::phys_props runs 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 670 over it, 7.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c432d9cd838ca7396fb56b9384364c1d5048735c2c82b8d681c1979073d6684d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFrame: TooManyMethods \u2014 220 methods. The bar is 30 methods; this is 190 over it, 7.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5d1cc0b0a6c3c25bf4a1db9caecd4d10e58771c5434e05b24d96fbf833194e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Column: TooManyMethods \u2014 216 methods. The bar is 30 methods; this is 186 over it, 7.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b755133f8507483114022f5e2264b0b53384c67c32d2618ccc9e7393dec463f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lazyframe/frame.py: FileTooLong \u2014 3467 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2967 over it, 6.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"159b95a7b58a5695f9f88983795034ba384e01191d069279696e3de3331fc853"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::fmt::visualize_plan_rec: FunctionTooLong \u2014 polars_stream::physical_plan::fmt::visualize_plan_rec runs 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 591 over it, 6.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a2322070040608f46169c20912f8b677487ed48d0f85f2421a89d40bf0439"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/subquery.rs: FileTooLong \u2014 3320 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 2820 over it, 6.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94869593678f9c5ef38018f31c4ca2141f30f35d90f68cac926a127aed4a594"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLContext: TooManyMethods \u2014 187 methods, declared across 6 files: src/context.rs (148), src/subquery.rs (31), src/subquery_outer_select.rs (3), src/lateral.rs (2), \u002B2 more file(s). The bar is 30 methods; this is 157 over it, 6.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e140356a98259f92ddfa906acbbd918b9f7bad6e09d0e92791341a108aabe218"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series: TooManyMethods \u2014 183 methods, declared across 21 files: series/mod.rs (66), ops/downcast.rs (64), aggregations/dispatch.rs (14), series/from.rs (7), \u002B17 more file(s). The bar is 30 methods; this is 153 over it, 6.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2022370b57725685752a7a02cf545a451d1b3b194ed1a088ac7878949efc88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner runs 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 492 over it, 5.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e3e9c64c14b7b1f75dc3008d77aa3b274263adb6acaa85d09def4c22490d97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SlicePushDown.pushdown: MethodTooLong \u2014 pushdown runs 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 481 over it, 5.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":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d22ada3ccb8a448a906f522cd29cd6b321e1edda6274c4f4660c2e6c4536a6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFrame: TooManyMethods \u2014 168 methods, declared across 16 files: frame/mod.rs (99), frame/dataframe.rs (33), row/dataframe.rs (7), frame/chunks.rs (4), \u002B12 more file(s). The bar is 30 methods; this is 138 over it, 5.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/dataframe.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ce770a0539e46f718388d78e3f7074d9cd3c1c3de55fb962a900163d23a9c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_compute::cast::cast: FunctionTooLong \u2014 polars_compute::cast::cast runs 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 456 over it, 5.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"05896b4b0fc7317439f018380f17c2aff5726a4aaebbb2969670c59718b7b0e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLFunctionVisitor.visit_function: MethodTooLong \u2014 visit_function runs 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) in one body. The bar is 100 significant lines; this is 429 over it, 5.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cec4b3cc9cd1e9187580749560e2bf6916a27c8310c916bb487565ef8c9194"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRFunctionExpr.get_field: MethodTooLong \u2014 get_field 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":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a0e40ffd87e9e8c95775861630922b99bf09cd5bb4abd2d4938118208644f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::read::deserialize::simple::page_iter_to_array: FunctionTooLong \u2014 polars_parquet::arrow::read::deserialize::simple::page_iter_to_array runs 492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 392 over it, 4.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c92d064cf08787645badfa95a4243e0028c3f98667796f54903a243b97e481"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/lower_expr.rs: FileTooLong \u2014 2438 significant 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 1938 over it, 4.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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72302f29cb7790eba53bb4f5163ceac8e5ec148c39c7b6bc9d1c5cc02dea511b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChunkedArray: TooManyMethods \u2014 141 methods, declared across 21 files: chunked_array/mod.rs (55), ops/chunkops.rs (15), chunked_array/from.rs (14), aggregations/mod.rs (13), \u002B17 more file(s). The bar is 30 methods; this is 111 over it, 4.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"34118d4d03aff97261f18d0b0b28914c44ca9a7f192a7a5fed269b460bcf6339"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polars/selectors.py: FileTooLong \u2014 2258 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1758 over it, 4.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":"py-polars/src/polars/selectors.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af6b3b7976f8a469290b4bf0456296b751a9582c9054b6cf4652c47ba3e47bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type: FunctionTooLong \u2014 polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type runs 446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 346 over it, 4.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a7c9dada1f599117eb1702cf04ecd518e9861df8c92b851afac46f0e94c48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LazyFrame: TooManyMethods \u2014 131 methods. The bar is 30 methods; this is 101 over it, 4.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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac4ae6ecf39fe77587922aa53e704f95c5d3d2e51fa43a852ea4375bed18b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LazyFrame: TooManyMethods \u2014 129 methods, declared across 9 files: frame/mod.rs (114), frame/cached_arenas.rs (4), scan/parquet.rs (3), src/dot.rs (2), \u002B5 more file(s). The bar is 30 methods; this is 99 over it, 4.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":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2820df9d4fc7de379dbf356a9ee4461a3cf860ee13f9ad833b9d098ccabfb78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/functions.rs: FileTooLong \u2014 2027 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: SQLFunctionVisitor (2 blocks, 46-3369). The bar is 500 significant lines; this is 1527 over it, 4.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e586e4417144f1f807a5d67ff8aa34bd08e02ea30549495c0b7be04f559be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_expr::dispatch::function_expr_to_udf: FunctionTooLong \u2014 polars_expr::dispatch::function_expr_to_udf runs 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 305 over it, 4.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8974b6e270906a53bbf7e80e6c2533b62326c246a7e9167e23db977830aee5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::lazyframe::visitor::nodes::into_py: FunctionTooLong \u2014 polars_python::lazyframe::visitor::nodes::into_py runs 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 303 over it, 4.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e59a58e7e0eaf30c308009975965792bab6efd345026f96ee82d7c1b0a1a71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.execute_select_block: MethodTooLong \u2014 execute_select_block runs 400 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 300 over it, 4.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4223a65aef46c1bf3c536d094b5ecc456015b6539b377d78884ec16214d8d64c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_expr::planner::create_physical_expr_inner: FunctionTooLong \u2014 polars_expr::planner::create_physical_expr_inner runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/planner.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc5cd464348f8de8a68983a64e1e58b96876a334e3d3a258207c7f04f9451b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprOrderSimplifier.rec: MethodTooLong \u2014 rec runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ae182392a43a9312fb396bf5f731f246ff745a34e78cf1cb600d9d42eb3f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner runs 396 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 296 over it, 3.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bfdd1b83af8f7daebe1f20f2054fbfe7e9cf6dc2786418a24b00e648ed26e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::to_description::ir_props: FunctionTooLong \u2014 polars_plan::plans::to_description::ir_props runs 395 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 295 over it, 3.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"404711c7ab04d3d2aa1ad701677f4e9eb0f8f4be011c2ea1dab6b96085251265"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IR.is_ir_equal_shallow: MethodTooLong \u2014 is_ir_equal_shallow runs 394 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 294 over it, 3.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/equality.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"931aeeca133bbf42399b3eb6fd9d5fa8d59b3502a866894056433022ac4c6ee0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PredicatePushDown.push_down: MethodTooLong \u2014 push_down runs 390 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 290 over it, 3.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e373577abf58ff51377665c0c73f4b64056896ff79c1181788d77f14e14b2067"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProjectionPushdownVisitor: ClassTooLong \u2014 1546 significant 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 143-2554. The bar is 400 significant lines; this is 1146 over it, 3.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f3dcc8a094232c2e0f5ee0f2157d7c7421177182c0710f2edd6924c2ca0efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::predicate_pushdown::join::process_join: FunctionTooLong \u2014 polars_plan::plans::optimizer::predicate_pushdown::join::process_join runs 384 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 284 over it, 3.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"448022c008b5b20825215f0791388eca0643187f651dd75eefe70b2b688850c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql_expr.rs: FileTooLong \u2014 1898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: SQLExprVisitor (2 blocks, 187-2162), declaring 49 free functions. The bar is 500 significant lines; this is 1398 over it, 3.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d868e2e901e5715bb17f44780596325dc5daf17eb6da9fc617c44c952da7e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec: FunctionTooLong \u2014 polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4fc687e94ac00e9a02a3fb3e82be14050ed8d7849c4918c460289cb07f2e24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IpcFileReader.begin_read: MethodTooLong \u2014 begin_read runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c07ab155f79d4ec302ca6c45b3075e9bbe97600c45f8e5d613b719fc6bfa9d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/expr_nodes.rs: FileTooLong \u2014 1874 significant 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 1374 over it, 3.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fd32db422107d4797602e4bcb7d833ff6e7b2149cda0034c5453057bb3efcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projection_pushdown/mod.rs: FileTooLong \u2014 1853 significant 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: ProjectionPushdownVisitor (3 blocks, 143-2554). The bar is 500 significant lines; this is 1353 over it, 3.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af7ddc65ffaf08b00f32887cf9d73b283da41781a849f6655c773255fd332e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionWalker.walk_rec: MethodTooLong \u2014 walk_rec runs 368 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 268 over it, 3.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e430fcdcd2fcbd05bbaac388bac382bb83e43966998122e468cbd8f1e2e6f9f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/context.py: FileTooLong \u2014 1814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1314 over it, 3.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d4f99ca578ec755b477b86048b4c969342164b8bc0c9a0932fcff72056f752"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/lower_ir.rs: FileTooLong \u2014 1788 significant 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 1288 over it, 3.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":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b217c8e49b6ebc2f7a2125843f2669203d0cd23fbd3390ba3f397bbbf9686c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr: FunctionTooLong \u2014 polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr runs 357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 257 over it, 3.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c051228a919050fe43fd8d114f9f03c6302e2500592e90b379c3ce28c60dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::write::array_to_page_simple: FunctionTooLong \u2014 polars_parquet::arrow::write::array_to_page_simple runs 353 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 253 over it, 3.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"90740e52f538f65014459de853b9e73427e0c973ec75754fc2051f0ce924d2c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_core::utils::supertype::get_supertype_with_options: FunctionTooLong \u2014 polars_core::utils::supertype::get_supertype_with_options 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":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c9a18d162cb721cf5a9e7341ab525b0807de23b0c31a9d15d308de1acca89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimplifyIRNodeOrder.simplify_ir_node_orders: MethodTooLong \u2014 simplify_ir_node_orders runs 342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 242 over it, 3.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e25eb2b127643a73a86c2c875d7bfc5268d952699d4ca5312401ac8cc4556c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::c_api::_polars_runtime: FunctionTooLong \u2014 polars_python::c_api::_polars_runtime runs 339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 239 over it, 3.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/c_api/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900ef36677098618a0a3f2de73625ed3082c23ef4fa41cfc02a7a851820d3b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::sortedness::is_sorted_rec: FunctionTooLong \u2014 polars_plan::plans::optimizer::sortedness::is_sorted_rec runs 338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 238 over it, 3.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"615775f0ab4bb8009ff0a80d75ebdc1881c1a6b271aaf59dd6a19b52b523416d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::conversion::any_value::py_object_to_any_value: FunctionTooLong \u2014 polars_python::conversion::any_value::py_object_to_any_value runs 331 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 231 over it, 3.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4638242dfd8f8fe6cc6730f6d1749919d1a09b98d5e24b40f444de88c95ae5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/to_graph.rs: FileTooLong \u2014 1649 significant 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 1149 over it, 3.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2208d53dd6a8d589d7684e6c0f033f7c5692431969edce564142652c47699ab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SQLFunctionVisitor: ClassTooLong \u2014 1316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 2 blocks, lines 46-3369. The bar is 400 significant lines; this is 916 over it, 3.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4297c4cd7d5e2af12999b2e9f37460cd87d29f5dfe5c23082b70e74f7115ccfd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.process_group_by: MethodTooLong \u2014 process_group_by runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd59c070b3180e19f7abc817428bc91b25f6e4e7c2dd25bd3551b62cc848b7ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRFunctionExpr.hash: MethodTooLong \u2014 hash runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"163fb17fc05073fd1e0fa1b7cab540b3b22b676275b0750f8fa963ebc06b77f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline: FunctionTooLong \u2014 polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline runs 324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e14aea5fd9e66073e369b9d2f29395d8b38b23aca8fe4967dfc0c29b2794b2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionExpr.hash: MethodTooLong \u2014 hash runs 323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ae7c5f453f1fea90267c725160dca394374f27ab24e244c6332cc159c0f780"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions: FunctionTooLong \u2014 polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions runs 323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"291b6925ceb4d3687d339e69ca2ff64da3a017fa6ceead542c0c07b79953653e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataType: TooManyMethods \u2014 95 methods, declared across 3 files: datatypes/dtype.rs (88), datatypes/field.rs (5), ops/json_map.rs (2). The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1db7bdf7822ac13a06b8bae7c4a33d2220d98c9fafb80e1b8f23433bda464a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Wrap: ClassTooLong \u2014 1256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 68 blocks, lines 73-2284. The bar is 400 significant lines; this is 856 over it, 3.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef9c48a020f07a78b4a95a89785754500904d217bbc3283a7e98c7fb341e277"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Series._try_from_arrow_unchecked_with_md: MethodTooLong \u2014 _try_from_arrow_unchecked_with_md runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c63779386bafd7fcf28148aaa7678af260e1ded0b33b08b0564e2414c00bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: conversion/mod.rs: FileTooLong \u2014 1538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Wrap (68 blocks, 73-2284). The bar is 500 significant lines; this is 1038 over it, 3.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d86b29d8ff430e34041f63ce0468d7862347053ad15f7047aff535f0b17550"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimplifyExprRule.optimize_expr: MethodTooLong \u2014 optimize_expr runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"227945e7798395abb88599d63a52bbcdf46948f518dc2d23b6d15a93bce0ba02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::ir::format::write_ir_non_recursive: FunctionTooLong \u2014 polars_plan::plans::ir::format::write_ir_non_recursive runs 304 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 204 over it, 3.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba11229b95cfd3e5f1a5c47ba8ddbd81dfbdfbb6a2a45381763a8513db0f923"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyDataFrame: TooManyMethods \u2014 91 methods, declared across 8 files: dataframe/general.rs (69), dataframe/io.rs (6), dataframe/export.rs (5), dataframe/serde.rs (4), \u002B4 more file(s). The bar is 30 methods; this is 61 over it, 3.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":"crates/polars-python/src/dataframe/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"319ce0b7b09b5c67e8cb1a66b5ec0be4128669abecb491d8d40d4745e2622d0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl_to_ir/scans.rs: FileTooLong \u2014 1503 significant 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 1003 over it, 3.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15a751f9566d09aaec579ac18def37faa9d50cbd417ec1c7d98756a728abcce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SQLExprVisitor: ClassTooLong \u2014 1199 significant 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, 2 blocks, lines 187-2162. The bar is 400 significant lines; this is 799 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee4b91f355ac51ae1cd8e1892631db849dbd7629a5a6749878d85e3b5e5242"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyLazyFrame: TooManyMethods \u2014 89 methods, declared across 4 files: lazyframe/general.rs (83), lazyframe/serde.rs (4), lazyframe/exitable.rs (1), lazyframe/visit.rs (1). The bar is 30 methods; this is 59 over it, 2.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3d0d6ce89d820043aaefbb73e124e31488dc409696466749ae87f6a6701777"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IRFunctionExpr: ClassTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 5 blocks, lines 113-1555. The bar is 400 significant lines; this is 769 over it, 2.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11c11c27a1b8042f0f3f4fdd2507b97cbe71ac2c04903bac7bd1e93c5b87acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::join::resolve_join: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::join::resolve_join runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5673771a186194abdf0c912cddf183c4b585d8ced03023e730097777eef1397d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataType: ClassTooLong \u2014 1155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 95 methods, 9 blocks, lines 90-2029. The bar is 400 significant lines; this is 755 over it, 2.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67dc0ac48ed049c198bb50489f226bd037f45073e24b98b1dbb6076965fca72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/_sink.py: FileTooLong \u2014 1441 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 941 over it, 2.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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0ddcc46f8de51a7449e30bd2e11d52f107994d6d5d5189dd704428bc0c504d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AExpr.to_field_impl_inner: MethodTooLong \u2014 to_field_impl_inner runs 287 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 187 over it, 2.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e9d3ee2f5e79c672f3a1daee8e5e0c597e6b38dccf52c54eea28b0350b6cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Column: ClassTooLong \u2014 1129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 216 methods, 7 blocks, lines 45-2004. The bar is 400 significant lines; this is 729 over it, 2.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c7cacfea209b5240f1bfcf484d7ce21b63fcfed24673735a43690ce8f7d3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges: FunctionTooLong \u2014 polars_stream::physical_plan::lower_group_by::try_build_streaming_group_by_with_key_ranges runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5d8ca06e23a85da6d0963a117fdc160bf4a405f2cb8db7dbde911c48d5245f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl_to_ir/mod.rs: FileTooLong \u2014 1406 significant 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 906 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":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d33475fd3a37cc0768f4a2bc443266efb93215d17ead41a841ed42ba502f68c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.lateral_join: MethodTooLong \u2014 lateral_join runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf71529ec9b924d7cf30b3af02e849cfb4a93f1bf98ed449205ab226ab08a631"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NDJsonFileReader.begin_read: MethodTooLong \u2014 begin_read runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad976557e4cad4ff7428d98d1271551c66b0ae8b4a77f82e7229471fd391bd50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datatypes/dtype.rs: FileTooLong \u2014 1392 significant 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: DataType (9 blocks, 90-2029). The bar is 500 significant lines; this is 892 over it, 2.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1f6258a5c6dffc73b4d1e24577c41f55e2b950568ee2c18cb7579f5d5e583a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lazyframe/general.rs: FileTooLong \u2014 1390 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: PyLazyFrame (92-1724). The bar is 500 significant lines; this is 890 over it, 2.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ae5919f2aadc5effe6ada09ea826a700f14641587d9a7ce689b02702537cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprIRDisplay.fmt: MethodTooLong \u2014 fmt runs 276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 176 over it, 2.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f238becd0a9cc85aa65219e2749a29ccc1e1f30753a71f39e32c03762924013"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnyValue: ClassTooLong \u2014 1102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 16 blocks, lines 34-1582. The bar is 400 significant lines; this is 702 over it, 2.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87c932a9f7aedc82a63ee3e21d19d28bd9ea0b779571c10b0e542ff25c6e494"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRDotDisplay._format: MethodTooLong \u2014 _format runs 271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 171 over it, 2.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":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b243788b6a6d53ca1bb9cdc4aafbe0d23b0447893da8f73385db926773e2e7aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/lower_group_by.rs: FileTooLong \u2014 1352 significant 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 852 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71e672f1c23f3ea48fd45bf2deba0d54069b75a4d60922c0a7088bdeeb82b11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRFunctionExpr.function_options: MethodTooLong \u2014 function_options runs 266 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 166 over it, 2.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":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3bfa5916af5e02f7919bfb8a9c5f8ded139e78ba4b4d6b25b1506f9146fe40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataFrameJoinOps._join_impl: MethodTooLong \u2014 _join_impl runs 265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 165 over it, 2.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"191e67313fe681891bcaa77b392ae48298fc6783278190d865aec9ce95477c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frame/mod.rs: FileTooLong \u2014 1324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: LazyFrame (5 blocks, 77-2002). The bar is 500 significant lines; this is 824 over it, 2.65\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c21ac7e1780e57ee98250100b42b3b57590efc2e68562650c80297e5e75e8e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AExprBuilder: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/builder.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb306602e2be667eef72aad2343ffcbf149a2e5f757f8d127e1f3308634899a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColumnSelectorBuilder.attach_transforms: MethodTooLong \u2014 attach_transforms runs 263 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 163 over it, 2.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":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd40a3937e8d93955231f21e6ce91bca81570c1931254546e17ee7148c331a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function_expr/mod.rs: FileTooLong \u2014 1313 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: IRFunctionExpr (5 blocks, 113-1555). The bar is 500 significant lines; this is 813 over it, 2.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5133cdf6efceeefc040903dcb3819870dfd063d52b00b13d7b850d925985e044"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WindowExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 259 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"258bfe2d7d54108a16a2411cabb9cf38779bc5df70b5cc441d42befe24d891ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frame/mod.rs: FileTooLong \u2014 1280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: DataFrame (90-2665). The bar is 500 significant lines; this is 780 over it, 2.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e645d816b7d5053d00ea17af66ecb3f51d3e96d9d2373c7db030ecc8592831d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_expr::reduce::convert::into_reduction: FunctionTooLong \u2014 polars_expr::reduce::convert::into_reduction runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/convert.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc5dbd564fbc2d572a4c605a4aeb54b9ca0340909a79de0cc6e271ddc3caf2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::extract_window::extract_from_projection: FunctionTooLong \u2014 polars_plan::plans::optimizer::extract_window::extract_from_projection runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/extract_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a191e8661096cc141f65186dffb415a8c6d05a8613665a7043b4ed6ff2916a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::ir_to_dsl::node_to_expr: FunctionTooLong \u2014 polars_plan::plans::conversion::ir_to_dsl::node_to_expr runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd4623293e10d6b34728aebc934ac96eb83937d51987b4d7e7a32232b605eaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeFmtNode.node_data: MethodTooLong \u2014 node_data runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b596c646c99e9c15767696f5ac21b23a7e6c75d47d1d185d392be033d4a0c9a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::write::array_to_page_nested: FunctionTooLong \u2014 polars_parquet::arrow::write::array_to_page_nested runs 253 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5319a4f2fea9fed4cde8d71a04be08814ff3c8166853c5689bed8ee5cfc5c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_coercion/mod.rs: FileTooLong \u2014 1247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: TypeCoercionRule (2 blocks, 40-1321). The bar is 500 significant lines; this is 747 over it, 2.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7522eaa64c8a07c0e907fbfb5cc404a6b5110453524c4344238ccda5d8f86a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CsvFileReader.begin_read: MethodTooLong \u2014 begin_read runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2466b2d1f385fd6f8a80b7662faeab951771a59ca6e8720bf1a7cc6bb1c3c876"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetReadImpl.init_morsel_distributor: MethodTooLong \u2014 init_morsel_distributor runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"668e3146b06ea330b6d5a27c04dcaf2a329536a3cfff9d56db253c1b61aefdcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl_to_ir/functions.rs: FileTooLong \u2014 1229 significant 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 729 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14cd8182268e0f49b4b08801dd0cab5530d9709d4d4244b5ee6e34afe788d88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LazyFrame: ClassTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 129 methods, 5 blocks, lines 77-2002. The bar is 400 significant lines; this is 576 over it, 2.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be53a3e44c5c47998a801f0299f75d629b230772c93c3a987b00b066f238f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::cse::cache_states::set_cache_states: FunctionTooLong \u2014 polars_plan::plans::optimizer::cse::cache_states::set_cache_states runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/cache_states.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475daaa5141821d3a54b8686dbc7a496c046efde0803b81dab923e8101a7228"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.group_by_in_derived_table: MethodTooLong \u2014 group_by_in_derived_table runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_group_by.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf5658e9a4f6176314d83dda353419c2a21453ad36979eb233ab7e94c75ec8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers: FunctionTooLong \u2014 polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"348f35bd75c8981c29f497ee83ba86fdfa6349dff2ee1860e91b3068b6857dd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl: FunctionTooLong \u2014 polars_stream::nodes::io_sources::multi_scan::pipeline::tasks::reader_starter::start_reader_impl runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e32947871a04e80e00c5a6bdbbf26deb7b4375f46c991f802a0da09cd104d98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: column/mod.rs: FileTooLong \u2014 1178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: Column (7 blocks, 45-2004). The bar is 500 significant lines; this is 678 over it, 2.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2365716395582bc0e13cdbcc2a910de5c8928afd2286b5f0f5f2ddd38088f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::stats::node::node_stats_with_cache: FunctionTooLong \u2014 polars_plan::plans::stats::node::node_stats_with_cache runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a778d83850e97befcd05e54e2b8e77af742cc61919467e130b90a29899c1840"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: conversion/ir_to_dsl.rs: FileTooLong \u2014 1154 significant 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 654 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"131b2b75a31ba0cede939158c1b3c7db31fcfb745c868bdcc4bb8ed7adee1808"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datatypes/any_value.rs: FileTooLong \u2014 1152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: AnyValue (16 blocks, 34-1582). The bar is 500 significant lines; this is 652 over it, 2.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dacbe6f4ef4374d3168d60391d3921b0f5013828cb07d3dcf1eac4bfd1e1342"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_io::csv::write::write_impl::serializer::serializer_for: FunctionTooLong \u2014 polars_io::csv::write::write_impl::serializer::serializer_for runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32e43524f620d703110e93f9e4d4195ee6326392316dacc7f9909d6d549662b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: construction/dataframe.py: FileTooLong \u2014 1143 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 643 over it, 2.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7290dc1214a523364887bfcffda8e30fee6ac8d4f1d7d5509fe00f0eb3b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.fmt: MethodTooLong \u2014 fmt runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/format.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754b00eefcd1c61e4efb2bf544830b437b88a091f35f6a3e3ce59272b94012e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeCoercionRule: ClassTooLong \u2014 897 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 40-1321. The bar is 400 significant lines; this is 497 over it, 2.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a9af78edd8d5a2425f6c66ff54b860ebcf65da38f6d651eef49649e45e9dd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionExpr.fmt: MethodTooLong \u2014 fmt runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f11ab0d55103c45c8a6435f3cd61b3384c10cda83b12067fc1e3f9083e9425"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRFunctionExpr.fmt_name: MethodTooLong \u2014 fmt_name runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"876dc05c1aa440cd8490baf71f15eb98ead3b7e14b55c3a90bff1ab90f4a23ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeletionFilesProvider.spawn_row_deletions_init: MethodTooLong \u2014 spawn_row_deletions_init runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd89a4db05a8e8ec363f43d3c86ea9a62ee4f2e6200c7c638c828b7ebb37502b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLFunctionVisitor: TooManyMethods \u2014 66 methods, declared across 2 files: src/functions.rs (57), src/window_frames.rs (9). The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3346560baba610cf8677be4470ea4fbe6ee0f31984276439dc2d18f9288d4d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderStarter.run: MethodTooLong \u2014 run runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.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":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b73c2b560740a3cbb6344326b2465f7a9dbb9b80abf1c5d657873836554453"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::write::schema::to_parquet_type: FunctionTooLong \u2014 polars_parquet::arrow::write::schema::to_parquet_type runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/schema.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f53df0df34ec0f67269bfc1ec2f06da808c8fbd94486ee9053648bae265778f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IR.hash_excluding_inputs: MethodTooLong \u2014 hash_excluding_inputs runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/hash.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c60a8d07b90afef4d699046803ebf5bcf6714c1b46f3e4194bfb7ab5713e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_row::encode::get_encoder: FunctionTooLong \u2014 polars_row::encode::get_encoder runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f87f24721fae0c8e4dca175869b86e3a7743d4a758a89839b123f05ff5a5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed88a6a29d377584b2dbe389a32ef00cc1c4682184a82bdbf73a047b8d40c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join/predicate_pruning.rs: FileTooLong \u2014 1082 significant 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 582 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4788b54027d00bde62a6f9424f2acb4acd3bb469e7502960b2767ffa6dd33ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/_utils.py: FileTooLong \u2014 1080 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 580 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60363761aee50099e090cc906738e6754bedf743b9ff8f73a09b1ba43b092096"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourcesToFileInfo.infer_or_parse: MethodTooLong \u2014 infer_or_parse 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":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3291cea3ae485c3d286873ea48cd1e8d7d82a504d48a13eb4b67263ae5b8cf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: projection_pushdown/field_pruning.rs: FileTooLong \u2014 1067 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: SelectionWalker (2 blocks, 110-1106). The bar is 500 significant lines; this is 567 over it, 2.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":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09929a28126e845c4a0d102d3581ef69cb119c98bfd23106d10d1f1b0d573d0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::dsl::serializable_plan::try_convert_serializable_plan_to_dsl_plan: FunctionTooLong \u2014 polars_plan::dsl::serializable_plan::try_convert_serializable_plan_to_dsl_plan runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/serializable_plan.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20dd4cd50e3bd3fe5e1f9b4d0f52b6f6888278ceb965e908b0bc697589f337"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionExpr: ClassTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 137-1092. The bar is 400 significant lines; this is 442 over it, 2.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":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29a58334d1091b9058b01015a59a0a3107d187ca2c7e56cb9eabd40ec9cf4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.apply_env_var: MethodTooLong \u2014 apply_env_var runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"26347d1df2619b217e83da4c2b2e364147d3966a66f759a950ad4eabc3ac8467"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::optimize: FunctionTooLong \u2014 polars_plan::plans::optimizer::optimize runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d483724973e6fd53ca992d79d730ecd42b87a941865ed5bbbca806131cf5224c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::dsl::serializable_plan::convert_dsl_plan_to_serializable_plan: FunctionTooLong \u2014 polars_plan::dsl::serializable_plan::convert_dsl_plan_to_serializable_plan runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/serializable_plan.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0a9b0404d432f6b05ad35860a1dc064fe9cb6c83a282ccd8cd8a2bc382f74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_sql::subquery_pull_up::try_move: FunctionTooLong \u2014 polars_sql::subquery_pull_up::try_move runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb6c16908d25de90d5e69be63aa9929c9a5209de96a828429a5533c6ae295cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::transformations::joins::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::transformations::joins::main runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/joins.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592e1d04dbf178586d8ace4da73ffd568a5fbec0be75429311fa5bcc50f41cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToArrowConverter.array_to_arrow_impl: MethodTooLong \u2014 array_to_arrow_impl runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"708980eed6dc20a69bd37fab85acfc6714d589cae4bb33a7ac88ddd78b9ad8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/subquery_pull_up.rs: FileTooLong \u2014 1002 significant 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 502 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d2f6cf3f53a111f2c7677f753019dcd3a7a6eddd9b6ff8fbd29121d0ba808"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartitionDistributor.run: MethodTooLong \u2014 run runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc61fe894acd9a00e17db259ed2fe1ee51192944e2edfadf1a1e13007111c93c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregations/mod.rs: FileTooLong \u2014 991 significant 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 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8713f7e90cc037cd57c770111a2b7a0366d1d9a2266e8b06960e30257cf3fe37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _utils/udfs.py: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 490 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a211f0e72a54892dbc7b4b61d76efc2a0fbfd3b0603f27dc4ed7d903116fe6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::aexpr::schema::get_arithmetic_field: FunctionTooLong \u2014 polars_plan::plans::aexpr::schema::get_arithmetic_field runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2750e381229e78745e74637b9123b58eb41eb24ae012708f08c6ea0addccdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir/format.rs: FileTooLong \u2014 986 significant 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 486 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33394c9f97511d41edef05cae129c9d48ed74d815a7cff5ff5e7ebd44dc1c6ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/semi_anti_join.rs: FileTooLong \u2014 982 significant 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 482 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96713239bda0aff14559fac6c7ae3dc58e66fb522a3f6800a551fc29235905"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/general.rs: FileTooLong \u2014 979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: PyExpr (33-1384). The bar is 500 significant lines; this is 479 over it, 1.96\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/general.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734ef8319ab98385c978c588f8bea3fb0d8a8163bd57b28c04dd68d8af76652"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl/mod.rs: FileTooLong \u2014 975 significant 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: Expr (100-1779). The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de91208431f1be6be84c7f8691f904590bb668450c3cf12b1769e57567c80c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fmt.rs: FileTooLong \u2014 973 significant 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 473 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165601d3f1aed5870cf5f930fef1be174bfe72fa447c4528711d172373575c14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: read/builder.rs: FileTooLong \u2014 967 significant 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 467 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43abf8bf19e5ba68954e0bbfe561c0a95d4898b76cfc0a4d0f707e828d2577ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::_visit_nodes_impl: FunctionTooLong \u2014 polars_stream::physical_plan::_visit_nodes_impl runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"665f739f534341d9c875e7c88af328bbc0072bc57869118fe4ff6f7e63e4023f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastColumnsPolicy.should_cast_column: MethodTooLong \u2014 should_cast_column runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a719f6e1af12ac43d687e42160a8b401820c1ec8b42293abb99b3a0557c9565"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function_expr/mod.rs: FileTooLong \u2014 956 significant 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: FunctionExpr (3 blocks, 137-1092). The bar is 500 significant lines; this is 456 over it, 1.91\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc94e54f8b5817990be84029d213f21c9b0767d9182c61bfd8c940f39c06ceb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PySQLContext.catalog_statement: MethodTooLong \u2014 catalog_statement runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f249b1619ec74703a384d746955eb034dde668b7fdf5e665f9649b3369040705"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/approx_quantile.rs: FileTooLong \u2014 943 significant 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 443 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/approx_quantile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d5e2a45be99616555845e1ea2ffba712dce67352c49282e4db2cd85b8d36b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spreadsheet/functions.py: FileTooLong \u2014 941 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 441 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b342a2c023e48b78ca4b87ffb7a35fc54df33cfad319a76b272a13c09ce2ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataFrame.fmt: MethodTooLong \u2014 fmt runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1ae4ed0755269e320ad9f813ea5e9274f9868796f10c22b069ff58d2d36622"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StringNameSpace: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/string.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7a6b04b0118af86ebb7aec0a7a3521880453bc49bda32661dd48c3da92421"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/string.py: FileTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 426 over it, 1.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":"py-polars/src/polars/expr/string.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0248702d05526db01e02f207bd19d246d15ee1f70a46c4cb8213fdddf4f2be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::scans::parquet_file_info: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::scans::parquet_file_info runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5625b8b353e4830a70c330982f4002580c18b98e536cad616fe34ed8e719882"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: read/parser.rs: FileTooLong \u2014 923 significant 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 423 over it, 1.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":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13fdcdb2403010c98d51a38968b3e5c1d2c539915e2d29b8dcc623cb982804c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mod.rs: FileTooLong \u2014 921 significant 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 421 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78958cdf59d338fac96df59148a9c25c97b4e4cdeb079e38b1046927ef589bce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.add: MethodTooLong \u2014 add runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282c743c992c4dc033842b8e22a8a0073f43e1efefaa707a2fc16bac48f19fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/misc.rs: FileTooLong \u2014 913 significant 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 85 free functions. The bar is 500 significant lines; this is 413 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e115e9251ecc3c667c49e7546d41efb814faf18e61bd9df2f9d9b7a5b936e48f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive: FunctionTooLong \u2014 polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"429cf7aa9da4e6398a1e1ca0e7ad64234db2fba379393c08c5ef5c331987121c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"55666279ae66054bcf99a647b9c10dec316d5eae35ffd39808116fdbe8b2a765"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MergeSortedNode.spawn: MethodTooLong \u2014 spawn runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfa4d6c213745f223c9a42dc11b8b3e9f6410e78482af0008fc58e35e9940c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SelectionWalker: ClassTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 110-1106. The bar is 400 significant lines; this is 312 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef6290e769d619401f7b5e7a69d7e8f6853d8521410d201f9470e6894a3306"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_io::path_utils::expand_paths_hive: FunctionTooLong \u2014 polars_io::path_utils::expand_paths_hive runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/path_utils/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cf7bd3c660a5cacb49b52f3d0f907a7ec8f67467e927f2645b364b48ddc16a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: write/mod.rs: FileTooLong \u2014 881 significant 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 381 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7659408780d498482befab65f60abe5e00f2312b1a7fe88dc15abe3f49779d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/group_by.rs: FileTooLong \u2014 877 significant 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 377 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d0f6f96052aff00066073ec54eac3f389473f58f3846d6405f7d4aababae9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLExprVisitor.visit_expr: MethodTooLong \u2014 visit_expr runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1afd7e98b9696b69761c1c7853dd99acd0880c50b0aca14792adffe36868a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::expressions::aggregation::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::expressions::aggregation::main runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/expressions/aggregation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea26c02ef7b34850d4ca926fa04173b87609223914c2c4a246fc83c93d2ec440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cast/mod.rs: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 368 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5480fdfd06b03db67df0ccd412db16e4d430150c7a66fa4c07d66100123b5d9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Schema: 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":"crates/polars-schema/src/schema.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"50643a0185fe932e5d6beedbac7df47c5fd59558403d90183dcaf2d3ebe5ad2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive: FunctionTooLong \u2014 polars_parquet::arrow::read::deserialize::nested::columns_to_iter_recursive 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":"crates/polars-parquet/src/arrow/read/deserialize/nested.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5ef7a06be4ba23a43ed6be572a242a7f44d4143be322843b230ad08b0a35f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::on_startup::register_startup_deps: FunctionTooLong \u2014 polars_python::on_startup::register_startup_deps 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":"crates/polars-python/src/on_startup.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"721b403788bb66bf3fd5697e6e6a9b62c07901c9022004b8c11bb238cadf8893"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SinkState.spawn: MethodTooLong \u2014 spawn 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":"crates/polars-stream/src/nodes/group_by/sink.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea29edd7b5e6324e71569f2f8dccf3592e4f72b27607d7e8550c8e06de832df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simplify_expr/mod.rs: FileTooLong \u2014 863 significant 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 363 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58bd87afb1268071d9c73cddda5b1778167b552baa64ed076163a350501a107"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.try_decorrelate_scalar_subquery: MethodTooLong \u2014 try_decorrelate_scalar_subquery runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"1342aefff91901d7160ff95986ce2c01055c17b75877ea2695cbcc792b520082"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_scan/mod.rs: FileTooLong \u2014 856 significant 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 356 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67f99cd9c18b1a3c3db9aa92a2506f4d0942c3b911c0e3403ccc12a4977cd6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aexpr/filter_constraint.rs: FileTooLong \u2014 846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 346 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f412f0aec3d4cdc1ad52c55e26a9fc003243a6d085f1625b580fff3a71bec43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PolarsSQLFunctions.try_from_sql: MethodTooLong \u2014 try_from_sql runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e08f7bcc088e91dc8a1f2e9f0c27046d61c57767f301a56c8f07d50f2b08d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColumnSelectorBuilder.attach_iceberg_transforms: MethodTooLong \u2014 attach_iceberg_transforms runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"318096415066625a8c9ef999bd8867b8050e80bbb5a6aa2ce4c34aaea5cb684f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnyValue.strict_cast: MethodTooLong \u2014 strict_cast runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d3c28c91321e7dfe0fe0e682e9d7ec1cd218f9c863a2d9c9b8b202bbd7b1a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLExprVisitor.visit_binary_op: MethodTooLong \u2014 visit_binary_op runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da446e28b7dc7577d9516943c4807ba8f96305a30bad8fc6603ea1002763d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/to_description.rs: FileTooLong \u2014 835 significant 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 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e39d2e9a11962a6e49e0b2f946b6c7a28180a5da7739da78297b2738d43768"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal: FunctionTooLong \u2014 polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf6b5b3437a3658c4699d03bd39ca01ef3eda15d088ac119fc1a2595ce5a19e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 50 stored fields beside 54 methods. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2368351edd6199755f516c0c276ec21c273ac4a3156340b9ab51167b55781547"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.merge_plan: MethodTooLong \u2014 merge_plan 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":"crates/polars-sql/src/context.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a291891485bb3aab32090338e15691c2512cfebe5bf3f0e9bec2f1b11ba0ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetFileReader.begin_read: MethodTooLong \u2014 begin_read 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":"crates/polars-stream/src/nodes/io_sources/parquet/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea9af5435d83faf19ce86060e4a16cecd3110489c841c11bda27c19a681de3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/fmt.rs: FileTooLong \u2014 828 significant 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 328 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f064afe32bba5b53e132fa2715fadf9512f64cffb018dbf5a279e67b9d8dd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/_dataset.py: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b30a203bfaf0d3074e09051086cd9479475395f39f6e512aeaa20d73a0a5ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SlicePushDown: ClassTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 12-1052. The bar is 400 significant lines; this is 256 over it, 1.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":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf19648f498a72083e2ae93de7e6ecc6e1229efb266e3fb33ebc71e2c4b83f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/groups_dispatch.rs: FileTooLong \u2014 818 significant 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 318 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fe4a908bcfbd553070fc0facdb3bcd7784db7d47e80b651f6d24e2e0d3b904"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5e0825c1c9556c03a849d5a5db428cbd35b5a7f29496f23b88a5e292ab823a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::aexpr::determinism::is_inherently_nondeterministic_fn: FunctionTooLong \u2014 polars_plan::plans::aexpr::determinism::is_inherently_nondeterministic_fn 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":"crates/polars-plan/src/plans/aexpr/determinism.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b36889f4be199d89909ecbacd0468effde0361d768c1d551f538e0707c6c809"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: delta/_sink.py: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14307dffe3b95f3362975c426987e97486219915dbff4228089a74878d044e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility: FunctionTooLong \u2014 polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"105cddde756070f027792af85ca5ecede3fc298489f82ef462a92cc8ceb94aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.try_attach_join_membership: MethodTooLong \u2014 try_attach_join_membership runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced5c1f0ff8310794ae218686927b5fc023ad9a48cbd23998c4fb8f445e0059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decimal.rs: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35523b32693344dfb6d79497a9892b2444da1a4c7116c7ab7a6f9b16f5edba49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprStringNameSpace: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/expr/string.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad15ba2bd965e63af24ec9b588078665474529481c78444d36f18cd5f13b82e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StringNameSpace: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/string.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6139c77bfb672478b50636be05da2a90e648527ba90db478b5963781663c93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: series/from.rs: FileTooLong \u2014 798 significant 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: Series (12 blocks, 18-1134). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81a92fdceb0b5be3dced004dbced81deb66afa1deea1d58ffe578e597160ae6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcurrencyController.spawn_control_loop: MethodTooLong \u2014 spawn_control_loop runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"255086b28cb52c15ee345bb0a10f9e7bffcdc466f951d33baec75c8725c9d99e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl_to_ir/expr_expansion.rs: FileTooLong \u2014 784 significant 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 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea90832a914bcf08e357269ae26bc2e840cd3031e1ec096408bd3b8c5b24fa6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/nodes.rs: FileTooLong \u2014 781 significant 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 281 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b611d27ad8d1590ace5d60bc0039241e5b3696650140e98c3a00c4cff75a1843"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SliceExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"61878ae96fd8a8f291534897953097542da7183d101931f2585825b634e09448"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function_expr/schema.rs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: IRFunctionExpr (8-653). The bar is 500 significant lines; this is 279 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f133668a169abac674867c3e299e77c1704abb60c8982b26ef2595ab8421fe7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/window.rs: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: WindowExpr (4 blocks, 27-1077). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6600fe38d544b579117e84e1cc48ac5828d43ef7c29cea97cb52259d956ac7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stats/node.rs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325ee9199ac5be88549ce80a27519dba9f9583b05e047dd778ecefe09684669f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataFrame.to_ndarray: MethodTooLong \u2014 to_ndarray runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ndarray.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"956fcc670201d8a744458f7ca19da6f45fd7cf8246e5cce9cdfdaa6e7e3b8f8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::aexpr::predicates::column_expr::specialize: FunctionTooLong \u2014 polars_plan::plans::aexpr::predicates::column_expr::specialize runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccb3fe74ec27d5bc911bff3d439ad194a008eaaff83c94bc1335eeb535ba3fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sinks::pipeline_initialization::partition_by::start_partition_sink_pipeline: FunctionTooLong \u2014 polars_stream::nodes::io_sinks::pipeline_initialization::partition_by::start_partition_sink_pipeline runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/partition_by.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c1bad17449433691b1c0529a3bfc97e20b799eaab4c6e3937a8b877212f9b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RowGroupDecoder.row_group_data_to_df_prefiltered: MethodTooLong \u2014 row_group_data_to_df_prefiltered runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f9db867e6d3789f5e520c438c3176cacbed7b2e1dd8e21218e510b5a7edd27"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WindowExpr: ClassTooLong \u2014 614 significant 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, 4 blocks, lines 27-1077. The bar is 400 significant lines; this is 214 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":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7450060ef85fbb658defe018430b1438494b6dbdacae723ec7ca7741a57907ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Duration: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2989c094d18cbe2ee6eeed73ada4555b50dafab02f28aa11a2d19b8669d5bbd2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: polars_expr::dispatch::datetime: TooManyFunctions \u2014 46 free functions. The bar is 30 free functions; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/datetime.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"febdff97914af96c0989f2a64a20a949a78c871d640057fc59c2bfdb04a47d3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectionBuilder.build_projection: MethodTooLong \u2014 build_projection runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"05abfaacf744e677b54e20b5f84c394ab2b867ab60f0487692d880d51c31534b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aexpr/schema.rs: FileTooLong \u2014 758 significant 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 258 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff5f3fa829882734074dd9e41aae2bd624fb9e9df43fab7431f4717f32846a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TernaryExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfba25d84c0e84835f1b3f1d3de4077b084e8b77426cecbabd0a94b92cbe7cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.process_implicit_joins: MethodTooLong \u2014 process_implicit_joins runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57aff3c2a6c81aaa0ee55ab9a2608c985569b5e25d5161a8fda9d043576b2df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/encode.rs: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be9d8189008de7cc3baef93c85940579ba39ec5d101dad0be387c9d9b16817"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/expand_datasets.rs: FileTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 244 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ba2efbd348fec45f31dc23eb325cc8bd384bce18da267ba4d671267e57f3d6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Series: ClassTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 183 methods, 5 blocks, lines 172-1221. The bar is 400 significant lines; this is 193 over it, 1.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":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ad2b8d6dcde8bed3a909e113a5bf02cd82ceab3ea9845f431e2c0210505556"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/mod.rs: FileTooLong \u2014 741 significant 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 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e8ba14be5e1da8ccc0120e1c7944c7dc648efce7ac72c2c0b7bd89e83451d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::scans::dsl_to_ir runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db1894437088fc65664157ab219d64788bf5e92870508577d60f18d297a5dd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::expand_datasets::rebuild_scan_from_expanded: FunctionTooLong \u2014 polars_plan::plans::optimizer::expand_datasets::rebuild_scan_from_expanded runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d8b343bce387ac01df366e01fc371d83834b269d77364cdffcc13ef4793bec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: series/any_value.rs: FileTooLong \u2014 735 significant 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 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f81ce2d9004537c7e10e71320b5b3421a7cc99417274d332b0b2ec0725e188"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DateLikeNameSpace: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dt.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3779d0a13c28a19e82636f869725270ef95a06b13195c47c01577aad9b2e95cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir/tree_format.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a446cd03e9b671a72a636107a44697460ac0abcf302bc68c9f030df861665c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_time::windows::group_by::group_by_values: FunctionTooLong \u2014 polars_time::windows::group_by::group_by_values runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e92ba595269fe98b4c6354cc708c8365c9ec8073772ee78fcd3893c42cc20b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::cluster_with_columns::optimize: FunctionTooLong \u2014 polars_plan::plans::optimizer::cluster_with_columns::optimize runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cluster_with_columns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"427aeabfeb80474de78a80b12c19873c5b0da23c9ea27214fcd7c17d546e39ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Wrap.extract: MethodTooLong \u2014 extract runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f2ed76633ea930342f013456fe5db431600b611dd51504d1067a3e22a804b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/slice_pushdown_lp.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 91% of them inside a single declaration: SlicePushDown (3 blocks, 12-1052). 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":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f902e30930b00b00f757b1a30f8eff81a01d02546699d26300c309b0cb562885"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.execute_joins: MethodTooLong \u2014 execute_joins runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3786f2e902271306d25b3e8ade3361d67f9582f180e37c7835177b031a36fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_io::csv::write::write_impl::serializer::string_serializer: FunctionTooLong \u2014 polars_io::csv::write::write_impl::serializer::string_serializer runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d0f49b51952031f570d4f466ea8e00a7fb2f455ff6bfcf1327209dfc79787f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/arity.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc374cac64c506e3e97dc82320733b68c6901ac9007b72a0c1524335e23c159"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 712 significant 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: Config (2 blocks, 259-1008). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c8663b64db0b674dd6ddb17474848adf34c2f2c4845ae4dcac48288ec5d77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parquet/row_group_decode.rs: FileTooLong \u2014 712 significant 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 212 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b73d8580ae13e8f08c40959a47a4486fab88d7984a3cd124d25c913f5dab7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equi_join/mod.rs: FileTooLong \u2014 707 significant 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 207 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":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d7daf08bb8ba27e13ec7f9f4f24862c59075c7343b949522664ce84a2e3f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::python::pyarrow::to_pa: FunctionTooLong \u2014 polars_plan::plans::python::pyarrow::to_pa 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":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3647cda335ab06edc7c62baade2db5bfb3440f596762e3da1558659895c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_python::io::iceberg_plugin::v1::convert::import_output: FunctionTooLong \u2014 polars_python::io::iceberg_plugin::v1::convert::import_output 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":"crates/polars-python/src/io/iceberg_plugin/v1/convert.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e37b70c8f1804b62dd6f2909a6e701b6009b4eaabedaa6c6d6964ac871380b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.try_decorrelate_in_subquery: MethodTooLong \u2014 try_decorrelate_in_subquery 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":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10e7d4d13e06cde26a62cfc3ba0b56d71e3662453e2e21bc6df5ef0e17be634"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyDataType.extract: MethodTooLong \u2014 extract 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":"pyo3-polars/pyo3-polars/src/types.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd60c21eb76b481ed908994002646a5fb58225b07eb7c45822423ec1fc688712"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/sortedness.rs: FileTooLong \u2014 704 significant 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 204 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":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b68c4e03a674e6d736d920b5affb03a2244f7bd7bc2c0cb22423a4a85ee37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PageDecoder.collect_predicate_flat: MethodTooLong \u2014 collect_predicate_flat runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9277aa84901fa64f8fc4f15e0cb8a3715aa1b98e799958c13dfb6cd55d7eee95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.validate_create_table: MethodTooLong \u2014 validate_create_table runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"950287e7659bf42f26dcd5f30098d34507b9adb26fea3f76481d6a3b25c12173"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comparison/mod.rs: FileTooLong \u2014 699 significant 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 199 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":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d0aa45b709f65b850c2a83b2b430c90578a621e6e925b2de9a546283f94451"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregationExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0766666be2f3a1165a016a631f4041e3e86410bb4ab1cbf0e3654a9987829"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::type_coercion::binary::process_binary: FunctionTooLong \u2014 polars_plan::plans::conversion::type_coercion::binary::process_binary runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b055aa3c92b7e2a74ee0874ac6ab296d2d2b2947206061e1ea1a6f413056f43d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProbePartitions.partition_and_probe: MethodTooLong \u2014 partition_and_probe runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"70784ecfd46c714deef5a67dd8c2723a6d368fc9ecc19218741803f273a6d6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::getting-started::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::getting-started::main runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/getting-started.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb3b13d5004448f119f35122b10f666ea26107771b690d68676f6fc6f366cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reduce/min_max_by.rs: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 192 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"457df5e1c09a18e2c58789a39dcbfbf6a412134fe79cd3720450a2151b440b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PredicatePushDown: ClassTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 25-823. The bar is 400 significant lines; this is 153 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46e16480bd42cc01504f2a80bddd6f033e3d515d95a96fdf4b8212c8694e8ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nodes/top_k.rs: FileTooLong \u2014 690 significant 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 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc5e8c597a60c2ad484fc0f7cb4823120dd1ef72ac8e90fbcbcc3d9bb0c72e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Duration: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 7 blocks, lines 40-949. The bar is 400 significant lines; this is 150 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2177263db733eac22f6c78f5e8a809b90856f762976cb61511b42524db87bb1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mod.rs: FileTooLong \u2014 684 significant 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 184 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc65eae161a23f5475b1f91d9cb0796b6e1c06a6e4be7fd01728f95d6da0ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLExprVisitor: 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":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df166baa72bfcb182447db2594f0bed12237426c644b2edb77c6d5bb002be96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/credential_provider.rs: FileTooLong \u2014 682 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 182 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/credential_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e746836cfde0bf32f4e678c5427812a567ac9ab2c22d64392a06a874f826b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: deserialize/simple.rs: FileTooLong \u2014 680 significant 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 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aabfba9d0a032e82832bd66844322dcc8a56ffd49e96914af8b454343119999"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_group_by::try_build_sorted_group_by: FunctionTooLong \u2014 polars_stream::physical_plan::lower_group_by::try_build_sorted_group_by runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7716ab935e93d9934a3228f0057f6c095d959fcdb02c716e2f92d60d60f60a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: planner/lp.rs: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb941ab3c14f61eafe5110674b777cec536d981f3f93683a89a04ee1e8e6affd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/merge_join.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1292ea1edfac47b600bb4b28d272c32e3e069befda88229ffaf53c50fddb5bdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gather/chunked.rs: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49822dafebf7f2b95605c3125839e9d40249820556ddd5ed4dab1275df48fe25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::scans::parquet_column_stats runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a573dc99b94e3196f47d7df33655d31da7ef8678b182931f1b978b7d3762666a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice: FunctionTooLong \u2014 polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"195bf7e8883b1f2ca5783ad863351bf0d2191f928c05feec5d2d090cc2284056"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/http_rate_limit.rs: FileTooLong \u2014 672 significant 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 172 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/http_rate_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1a509abbf99699e7a23c14d402d56bde3790aaa1c8f37d1ed4be1517320290"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl/serializable_plan.rs: FileTooLong \u2014 670 significant 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 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/serializable_plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0b9965d7d29d974b22a2db7ef9a66d6d1420e8d99153d6f7d7617d04e0be0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_sql::types::map_sql_dtype_to_polars: FunctionTooLong \u2014 polars_sql::types::map_sql_dtype_to_polars runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/types.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4c2ffde27026c8d574d23fe3b048eeea9eb78dd446b4bf32d465c2042c2964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chunked_array/mod.rs: FileTooLong \u2014 668 significant 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: ChunkedArray (15 blocks, 140-1175). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ca5b23fc79257515d1a5c59de6d00c895d874095a0d23c4f054d1be3d5e129"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/config.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"54193f9fe3c5fc23c01f5fe5023e64d64c0a4e155b3230c95290390ef4f05891"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Statistics: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/statistics/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2097152b5255d6073cf63c6203b95c4e1f0df1ab4f3c3d01c6fc7c8c65f813"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OrderStatisticTree: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e873f000351c363dd9e9471cee09f8045f4c02e01f997ed83e11c276158686"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_coercion/binary.rs: FileTooLong \u2014 666 significant 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 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b29caf57843c63b46a80233d1df3a6c11201d3440e436ee90d3cb3abf45cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnyValue.eq_missing: MethodTooLong \u2014 eq_missing runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a591be3f178b6638851d657517dd8838b97b5e0f44b8a9134c7c44a27ed631e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.hash: MethodTooLong \u2014 hash runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/expr/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e647bf39121cec0446494639e70730aaf8d4d8402bbdfb4ec847a2caf9d65c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: series/mod.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Series (5 blocks, 172-1221). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3adb94a386129fa6bbc3460d6df564b92e24891c15a433f74715c2352eaca4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bfef5d3cb39e7bfed2b3b1617c13cf8d9c12e41f0e408673cee9dcbb00d7a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NumericFixedSizeListOpHelper.execute_op: MethodTooLong \u2014 execute_op runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"909bd70c9ab990ed2faa7cece5abf2d23e1d5727967ecfdf4d164899d59e1dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: write_impl/serializer.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6ae50c720bd2907e464712783237854bf355f32925cbf1287b07da4d85e2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: deserialize/nested_utils.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2611e4f4ae8325d2488cbf3aa159ea8051986d710c0a43444507c1d7422b0cf4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AggregationContext: TooManyMethods \u2014 39 methods, declared across 2 files: expressions/mod.rs (36), expressions/group_iter.rs (3). The bar is 30 methods; this is 9 over it, 1.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":"crates/polars-expr/src/expressions/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8328cfb3eb0cf2ee0e49adbd4e2cf4659417cd6a0794e9120f4dbd295604e308"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WindowExpr.evaluate_impl: MethodTooLong \u2014 evaluate_impl runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0787439c7d8f3d8ed7fa4cbde7f0bde0980eee696152ab6e1e4281572ac2e57e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRDisplay._format: MethodTooLong \u2014 _format runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b647deb06444225ad35b2a64b960ef8096485e8bcfc24179a41cb53e9ec56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sinks::pipeline_initialization::single_file::start_single_file_sink_pipeline: FunctionTooLong \u2014 polars_stream::nodes::io_sinks::pipeline_initialization::single_file::start_single_file_sink_pipeline runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/single_file.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1e0bda51024ad72546c7e770a0e918b6366df42e23a4ee38218578f3f28663"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Wrap.impl_group_by_dynamic: MethodTooLong \u2014 impl_group_by_dynamic runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/group_by/dynamic.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fc785eccb7d4c710cf1af0da74a274a97c845add499200c174059e650515da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/mod.rs: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: AggregationContext (3 blocks, 139-997). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14d6ed15dd9cebc7401af3b8ead51f1545ffe6743be498aba2dfed5defc4a7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/strings.rs: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8fb044c1ca38f0dea7c0fb1411852a97649dd266f278a65fbccefccb396b93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/asof_join.rs: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7798dce01d186dd49dd715796af8adfe0deeb373012ef00d22ac4ecf6d12874"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 54 methods, 2 blocks, lines 259-1008. The bar is 400 significant lines; this is 117 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ab1da42007c8e87fec6877e175a79242d2b9a406ab9f9fd7641fb19b005ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Wrap.into_pyobject: MethodTooLong \u2014 into_pyobject runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"454230223cc958877be9569b4c8413c4f3a186bcf7c31725e6afc827536944c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBatchDataFetcher.run: MethodTooLong \u2014 run runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"40274396d8a3b97d20bfd95791e3e535ac8e68ed24512894cea0433ba44385af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_expr::is_input_independent_rec: FunctionTooLong \u2014 polars_stream::physical_plan::lower_expr::is_input_independent_rec runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"be28ec0b5d127b70bc44dc92c82619d95905463d4ccc3dc474bad3258508376c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_group_by::try_lower_agg_input_expr: FunctionTooLong \u2014 polars_stream::physical_plan::lower_group_by::try_lower_agg_input_expr runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbe9ff3766130c428c2c25f39d29f7a10ac8482242c24fe5aef532fc4a314c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::expressions::expression-expansion::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::expressions::expression-expansion::main 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":"docs/source/src/rust/user-guide/expressions/expression-expansion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab3595e63318bd3dbd19b34d91ab5c836f257a659ff92e0e548fb6f7db18a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binview/mod.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"492b9d0e196967367510806c869611ed154fc259e09e21d6faff1fdb2eb74e31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join/mod.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefc05ef9e07857c5981969df56e824e9125aae4f03df20dc9807bb5c3d870b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datatypes/classes.py: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/datatypes/classes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff068155afa1e2760cb4ff8ed74d92485fcd2d8f6e807934dd9995a5d5e6d3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_core::series::from::to_physical_and_dtype: FunctionTooLong \u2014 polars_core::series::from::to_physical_and_dtype runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a172141f81b2ee9f5bfa705aff5e8f96054f931b77ebcc989dd3c532814d2b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::write::dictionary::array_to_pages: FunctionTooLong \u2014 polars_parquet::arrow::write::dictionary::array_to_pages runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/dictionary.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af45049097453fb0c3e6ecf7e02d79c3c948d9bdbd00e1a2d90c901ccc5de3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/extract_window.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/extract_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63907a44ec1065f5d3eeb609aee6da09ac95c4f2efa00cc858538812ddb63ccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/byte_source.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":"crates/polars-io/src/utils/byte_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742fa1aafaaa0592dc8e5669058886b56e7321abf169a59e3f073f214e822a97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyLazyFrame.new_from_csv: MethodTooLong \u2014 new_from_csv runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d164a2ca2c4afe9ab7064802cd0ebc6210189aa6fa3064aa19fd4738b440b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBatchEncoder.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":"crates/polars-stream/src/nodes/io_sinks/writers/ipc/record_batch_encoder.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0196db107082233162e0fa51f3da4ddd67836a87185c709f740a301a5ae0821"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnyValue: TooManyMethods \u2014 38 methods, declared across 2 files: datatypes/any_value.rs (36), ops/any_value.rs (2). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018ed0b21a914429dd57392a45f8dab9f483895f915a59a53e5da0f1035a14d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LazyCsvReader: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/scan/csv.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c412357b1eab1f736b195d70d6aec60228d5659c87688e3cf3d6cc5d02ee4c8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: polars_python::functions::lazy: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/lazy.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bd6f7d0b67cff20358070fd91b2bb6fdbba1e30efb7233b2bc6f8e4b864581"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/aggregation.rs: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5749d0388c987fc4256105a5dc37f390dc07582fb1f2cb32d165a41a8babfe0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/lazy.py: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a560f1c6cd1f9c7325a667663cde42f53b786f68939928a364e6ce8e61d098"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Shared.run: MethodTooLong \u2014 run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/flush.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc573262aad2503d7c19f61f20115b36309d193505c5266ede0d4640781dd798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: time/duration.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Duration (7 blocks, 40-949). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71659ad790f4c89d0c97ecdd07b3b6c4c057167200c5118a43280121573da8d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join_order/cluster.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932f1a906e04595b61361ff7f481d4d82131fb6191d5d8751be8ad00afb82eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: row/av_buffer.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"045aee09f0e8e0f3cb08f8fdfe2ec395cb186b98e454f8a2efa8212514cdc308"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalExpr.evaluate_on_array_chunked: MethodTooLong \u2014 evaluate_on_array_chunked runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46847bec1f1ed3231caf1ee691d37f9ca4cfb83306ff74567a494d7778edf3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitFields.next: MethodTooLong \u2014 next runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/splitfields.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"31387923fdbeaf20c6b8725cacba09fdd56f3f16a88ac34e7b9685484712afe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::join_order::cluster::extract: FunctionTooLong \u2014 polars_plan::plans::optimizer::join_order::cluster::extract runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8da0c78ca431de12795e6322af3b34d40834eb5d55d6b61b70afdb783265f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/polars_object_store.rs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/polars_object_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b579b72a1a30298597d931e2258cf73c18470164437ef901d250a37ca1a19b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_core::chunked_array::ops::any_value::arr_to_any_value: FunctionTooLong \u2014 polars_core::chunked_array::ops::any_value::arr_to_any_value runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/any_value.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f8cfff72d49735bd6f76854af5befd11e5381333a44215e633dc57ef123ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.join_inputs: MethodTooLong \u2014 join_inputs runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4524}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b09d11cccf47ee0db146d0e954d1b4adeb826b72609c0fbf8e396d8138f33b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyDataType.into_pyobject: MethodTooLong \u2014 into_pyobject runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyo3-polars/pyo3-polars/src/types.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be7f5a063b2394d68718e8f314743ce8ecba22e44d1718074e48855ff345609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hash_keys.rs: FileTooLong \u2014 618 significant 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 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hash_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"728aeb744166959d24b8749dbd60280e1b992d3c8de10989efe8993d2d4c8275"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/options.rs: FileTooLong \u2014 618 significant 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 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"849464cebf69e2a95a1eedae73b596f45a9cb1d26845ea46f334aff760bdcc21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ListNameSpace: 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":"crates/polars-plan/src/dsl/list.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4aee59bf5aa9efb4193edf4afe611cd0e90197d09ce429574808dd8d504e6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top: FunctionTooLong \u2014 polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb26f64068cbb4c906e3ca36f0a1039c0f587ca9093672974d20fc879d96c74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColumnTransform.apply_transform: MethodTooLong \u2014 apply_transform runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/transform.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e49d9812670deb155e7aaabfc85cb874941d09cf7359040f4afd00b70f9c15e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: is_in/mod.rs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9485b96f9bf53af49af5180fda5f3778c26ee86306cce4c06239474463224d4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RollingExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/rolling.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83149bc311d5eca8cae8caac7c87702ce36a45e6b3c50db608597d0b7eac3c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info: FunctionTooLong \u2014 polars_plan::plans::conversion::dsl_to_ir::scans::ndjson_file_info runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c3c4e99031d187798fc6db53d547cc753917de513045337aced8e70ad8d062"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionIR.eq: MethodTooLong \u2014 eq runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/equality.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26536c21810f40638ec9045b50043136e20d61f4701b22450bcc27f6c584797f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/evaluate.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/evaluate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa88c42e9bce0e7018989e2df13938553de108ce86ed3d398a31ae6875e4d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reduce/mod.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 105 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0203308f0a8704cec036d051dc7c6f6c49f0520c7b925de722b9eb3d27b90ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreReader.parse_csv: MethodTooLong \u2014 parse_csv runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a2817a067462f88c899e36b0f751961fe480ce629012e9631516f856207832"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl: FunctionTooLong \u2014 polars_plan::plans::python::pyarrow::aexpr_to_pyarrow_impl runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1bbfa99dfa11df8009cd266665d2c1e75caf0a9b5bdb6b327bdeb0d68ff3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MorselStreamReverser.run: MethodTooLong \u2014 run runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4ae862d1653af4c1bccde0a180ef4c3ee1339255edc9b4daa5a35af8789f4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetReadImpl.init_row_group_decoder: MethodTooLong \u2014 init_row_group_decoder runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b25caad64e0f72b9bc50347966c2242ab925d9190693fa37df32a80f44b784"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/planner.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c060e3971027127f1f6bbf5a4456fb1593dbacb7b745c4e43de9b61fa357d74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DslBuilder: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/builder_dsl.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b3045fb007e3753801b14bf8aa2f0d5dc36d11596a1daa00e72c0ea8c661ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lazyframe/engine.py: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8345afeb7016f9a2caab0bd914925694990abe7c10956575ef8ccee96a2feeb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arithmetic/borrowed.rs: FileTooLong \u2014 596 significant 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 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7773371da4fa095444e7e9536afab4009c893b028e89da34c01089605e97f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataType.from_arrow: MethodTooLong \u2014 from_arrow runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/field.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae246a29f3fba033c6c2af4ddb53fd1d97326726711f7ea910a58c0e4e81281"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonReader.finish: MethodTooLong \u2014 finish runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/json/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bc3500837f2df7bb6daf4719f1cee8ff19e2a8a76bd649b82294c5f3ae4f18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Wrap.extract: MethodTooLong \u2014 extract runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b63afe309eb12b46af828f8c8fd9539adb5496a343021f0b03d034959225f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::scalar_window::reduce_partitions: FunctionTooLong \u2014 polars_stream::nodes::scalar_window::reduce_partitions runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/scalar_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba47fbf529eb7da1f920b684c327cab3e6d4e9cc1b64716b2eb206e05ad7b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::expressions::casting::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::expressions::casting::main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/expressions/casting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d87e79605cba5b7deee4e5d3962c566d28b81162330a462a4e497709bbefcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: strings/namespace.rs: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: StringNameSpaceImpl (333-952). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e96477255857d15e6144a8e1a3885b1550ddd555fbf51b74fdc68e6ce3dca7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hash_join/single_keys_dispatch.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bedebb6ac12c304934963e12730bacce5516d85df58e050c2a38c47da96546"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: python/pyarrow.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45126db4061c2b9083509bb15940c1368202a2727f696e863867902bebb37b1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arithmetic/list.rs: FileTooLong \u2014 591 significant 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 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd428acc754fe7db59922289360b91d40963e8daa961563ad88112dd69d23c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::window::evaluate::evaluate: FunctionTooLong \u2014 polars_stream::nodes::window::evaluate::evaluate runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/window/evaluate.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b085933121f44579dfd6451725abc1689ed0dec115f3cfb557e824dfd8a552f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::expressions::strings::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::expressions::strings::main runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/expressions/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b02a620dae92570820c4c37a37775d5d569ac828320c490bb02f542363e1ec9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::expressions::window::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::expressions::window::main runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/expressions/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5e8b6f0de2f0ce6b7c7acababe6df7b75cde427d54aa6d83bcf11314502d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simplify_ordering/expr.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: ExprOrderSimplifier (3 blocks, 93-770). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd34aa6b155cfa4b1d61ea608f29779b1447fa50c08bbeda468a22190a4b71c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: predicates/skip_batches.rs: FileTooLong \u2014 588 significant 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 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e37531fde167fd0752da0a575b865688b8d65face0de2b6358f531302dff51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sort/mod.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 85 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":"crates/polars-core/src/chunked_array/ops/sort/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"916ffc1ba0a182f358496e63be2a77da7df5b5dc1a8ebad4f525443d66b940dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reduce/min_max.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 85 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":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2514bea13f616f20be10337c3c482ccec2e060e1ac04b5ff50c712dd1c85df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloudOptions.build_aws: MethodTooLong \u2014 build_aws runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d02849f41cd5f5441e94b01d480c57491cf8ae40aa2326ca6d28ac9fbe78f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::sortedness::aexpr_sortedness: FunctionTooLong \u2014 polars_plan::plans::optimizer::sortedness::aexpr_sortedness runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8cabff8406b98a325ee17bba50e2d7f0453966913d19ac0f05d574a94202eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LineBatchSource.run_parallel: MethodTooLong \u2014 run_parallel runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"081068791634d39aec5aa8d7d6bfa19b198470b9c1650bb1053376f57b0a91b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::physical_plan::lower_group_by::build_group_by_stream_with_key_ranges: FunctionTooLong \u2014 polars_stream::physical_plan::lower_group_by::build_group_by_stream_with_key_ranges runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"4586156c6df1a320885fcacf3f505435036bd4964a9701462875475b4f1e538c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: polars_compute::cast::primitive_to: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/primitive_to.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d968399d52c2dfe6c0b989b404666a6996401ee9d6a8fc8b9f0435b21e140473"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/join_pushthrough.rs: FileTooLong \u2014 582 significant 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 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa7b64250176fe338c8b23d1e5b727d2745b0c02c7d026e01d858638d05dc7a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IpcFileReader: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 64-791. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"280aef298e32c4e64b476ff83fd9e823e464e641ea1e74e262c4992f3397f112"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iejoin/mod.rs: FileTooLong \u2014 579 significant 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 79 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab241a9544bf4edccd395dce4cf1bb0e3385bf53628f5497f1196c40fede64e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/spill_token.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: SpillTokenInner (5 blocks, 55-941). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07104d7e95cff06cded8eac4d0e3e715dc57e1697b70a986e594be9affa6348"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/mod.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":"crates/polars-expr/src/dispatch/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e52359eb16191f71031658a2ff69823127718c5f5eb29ae621864c7d365707"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ipc/mod.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: IpcFileReader (2 blocks, 64-791). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec39446c8f76def8620f59bede03e962802f76daeb07bcfe6fcb7e61f2e7af3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregationExpr.evaluate_impl: MethodTooLong \u2014 evaluate_impl runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa196fedea2d51e3d8decef8447e8d5b234d3416f3ee2e7c90f34af5cd62b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.process_asof_join: MethodTooLong \u2014 process_asof_join runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb8d1f9458942e51dfe9b456af0e6daa8790c2a43cf00bffc9d765937d0ecff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: predicate_pushdown/mod.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: PredicatePushDown (3 blocks, 25-823). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59e16f23871b3856c58fb05abc1ef2992564a263d81315e9e06ed97bd27a330"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parquet/statistics.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/statistics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0703684a4827fabd5d1ece6e9de8ebb7e87eb0fee422037c628607b26e25924c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_expr::dispatch::strings::function_expr_to_udf: FunctionTooLong \u2014 polars_expr::dispatch::strings::function_expr_to_udf runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f418fd161c164ccb82a65a6bbc4ec48fe91e7a64acac614bdf0cab9deee97e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_ops::series::ops::business::add_business_days: FunctionTooLong \u2014 polars_ops::series::ops::business::add_business_days runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/business.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f09dcb32babfaeccf7eb5c68b5c39da4b152954cc566270149e22b00e427a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::dsl::datatype_expr::into_datatype_impl: FunctionTooLong \u2014 polars_plan::dsl::datatype_expr::into_datatype_impl runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/datatype_expr.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e00fc4f1508687fe321c85493d55b2b615efd490bc2a3641d508a089124aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionWalker.walk_as_struct: MethodTooLong \u2014 walk_as_struct runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eac5cf41cf81ac90f6f2dd38dac45a0dd4ffb43b8a0789b63b0a05ca3ce9d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.process_join_on_subqueries: MethodTooLong \u2014 process_join_on_subqueries runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cfdd5cb4962fa6308909a5400f9871b474f6d971baa25a648c9156e754eb52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApplyExtraOps.initialize: MethodTooLong \u2014 initialize runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/apply_extra_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd59905577f2a75387fb73c384636bc323fa85eec47c41d37cb671911eb777"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_time::chunkedarray::rolling_window::dispatch::rolling_agg_by: FunctionTooLong \u2014 polars_time::chunkedarray::rolling_window::dispatch::rolling_agg_by runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d308bacf8a3aca74af4a8d09b8b45487cc830a091cace04a294566bec272e910"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/convert.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/schema/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6706ef1ac8eeb4a3f9265535cbca4a0a0831f01351b51e6916c786b41f07797e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprMetaNameSpace: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/expr/meta.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db01c5779c7d107d918cdfa4e5245f9bf3047780587e23c1c0ee8402edec422"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FieldsMapper: TooManyMethods \u2014 34 methods, declared across 5 files: function_expr/schema.rs (30), function_expr/array.rs (1), function_expr/list.rs (1), function_expr/map.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"349a824fdc36b41723835cb7b49db7e9bc44d06090bdf97c0964ae3b5c745809"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ColumnSelectorBuilder: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 19-735. The bar is 400 significant lines; this is 52 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"949595c83cd7fe67c22face7e6d0a49e4d188d9f2a0129e1b71756757b141156"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalExpr.evaluate_on_list_chunked: MethodTooLong \u2014 evaluate_on_list_chunked runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e857a48bb30dd1f4f17da5fc921f06cea6a696ff91db0140a1c27b8c5d079973"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_io::csv::read::streaming::read_until_start_and_infer_schema: FunctionTooLong \u2014 polars_io::csv::read::streaming::read_until_start_and_infer_schema runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"64825ae9913cd5b702e32115920a54f081cffb81d1f8352d426f1a6c73ff9360"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PySeries.to_list: MethodTooLong \u2014 to_list runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/export.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fd82ef60a8a836f944f8d2e1744ca452a20115fd05a96dad44302ec4233242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: read/streaming.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69956395181cf8d45267f1c05a74f8685a06ce075a9499462af066a5a0851fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handwritten_thrift/parquet_thrift.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46974bd8a01da47d4806fbfbf037ae58aad7da239f573d0c40c3c69332eaae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/packed_keys.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/packed_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8218e4d222714990e2a7ce60ab7bf40ea69db8f7230e52d2da367f33bab3309"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/selection.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/selection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b794bb9a3cabbf3a178174362018dd6cfdb0a4f23dba7f596c3990f52b9c94f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_mem_engine::scan_predicate::functions::create_scan_predicate: FunctionTooLong \u2014 polars_mem_engine::scan_predicate::functions::create_scan_predicate 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":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"852e2e42b9378b7b742494450eafed4ed29784486019cba13dc12fb3b6b1715b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::parquet::write::column_chunk::build_column_chunk: FunctionTooLong \u2014 polars_parquet::parquet::write::column_chunk::build_column_chunk 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":"crates/polars-parquet/src/parquet/write/column_chunk.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3065a674379c5785c4c31516e4bae162db7f82709532b50f2317f83404407d83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_doc_examples::user-guide::transformations::time-series::rolling::main: FunctionTooLong \u2014 polars_doc_examples::user-guide::transformations::time-series::rolling::main 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":"docs/source/src/rust/user-guide/transformations/time-series/rolling.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60cb2d76ab0fe7e0b9697a54e69d4d7664ea93533ab91b8aed8f5af0e0910b0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ApplyExpr: ClassTooLong \u2014 445 significant 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 16-721. The bar is 400 significant lines; this is 45 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":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c20d07c44813904879982816a1d535b3cff47f5602347ec9639b5b218233e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SortNode.partition: MethodTooLong \u2014 partition runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eccaf33a91a5c9e5370bd41824ae9f881157ef7a86be52a58030959cc45d4c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: group_by/position.rs: FileTooLong \u2014 551 significant 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 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/position.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160d80df373d95f526e437448c9c883fea9c29c93bd5cb5730e0bc82b13fff6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreReader.new: MethodTooLong \u2014 new runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a7438cf614192b4c2c1e91921d559831d6e2215ca704da04d678795ffd94af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader: FunctionTooLong \u2014 polars_io::csv::read::streaming::read_until_start_and_infer_schema_from_compressed_reader runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da9f96f8a8b985f6559e59228b3ec5d78a10d7d1c87b1655685f61ce72c2c7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict: FunctionTooLong \u2014 polars_parquet::arrow::read::deserialize::fixed_size_binary::decode_fsb_dict runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4256aa1f936e1a599281b06e826bb93566560854723354ccfdc74f0c58fb3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.get_table: MethodTooLong \u2014 get_table runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5852}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dfaed10845243227f22edbc6c10d1506c059bdd877ede360c5d6ce6bf142fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_sql::subquery::exists_aggregates: FunctionTooLong \u2014 polars_sql::subquery::exists_aggregates runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"4034bab84966e0d5d3f2dec656e9f9188d542c979e30ab9b7933696163703115"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_sql::subquery_pull_up::prepare: FunctionTooLong \u2014 polars_sql::subquery_pull_up::prepare runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdef7bc72d9b3a36cc30f75186ca035c09d26c86af797dc0829f2510f76d213"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SampleState.try_transition_to_build: MethodTooLong \u2014 try_transition_to_build runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"12094df59ec86a0ed3aa2109ab54132be28fd96b3d3c0b81c3ed2b8fdda1faa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scan_predicate/functions.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29882e5d10b752a5512d4352d39b2eb538339bf056eb31eed4d032b9a2daa2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polars/config.py: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2573ac5e9ddbc425d8f3ffaa6470e0a48d969b7095540fe36b7154fffeaadb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: group_by/sink.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e978f6129fba729281e7922eec38894d1b3b1f1895d67effe403f058a5ab4795"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChunkedArray: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 141 methods, 15 blocks, lines 140-1175. The bar is 400 significant lines; this is 38 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba62fb7ad56587df54206cb4e8752a136154dac65cf3aeeb74d7c110cf5932"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Builder: ClassTooLong \u2014 438 significant 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, 3 blocks, lines 704-1247. The bar is 400 significant lines; this is 38 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca229923a9720312651421dd7629fed869faaacfc70b9d8b946df6311ea9e043"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl_to_ir/join.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc491379bdc7c5c63955d552d8c7368f11485cfa5798d7a38680539f0e98fe4e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprOrderSimplifier: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 93-770. The bar is 400 significant lines; this is 35 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":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17b793dadcc63189be5954e7c85795c8904030f25339cbbde37c33e9d7ac1ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_ops::frame::join::cross_join::fused_cross_filter: FunctionTooLong \u2014 polars_ops::frame::join::cross_join::fused_cross_filter runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/cross_join.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7616ba5b460229946f0699a2ca403ed42cf96c3e363e67ad52bbe0665b35bdf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::write::pages::to_nested_recursive: FunctionTooLong \u2014 polars_parquet::arrow::write::pages::to_nested_recursive runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77b0b713be7daf558345c8ac8464ba856c292eed439b2360b9f0b3456fc6e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::aexpr::schema::get_truediv_dtype: FunctionTooLong \u2014 polars_plan::plans::aexpr::schema::get_truediv_dtype runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb2a803cf72edd29ca6a6ae6d92a12758a0142637d77244e1b3476fadd39d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyScanOptions.extract_unified_scan_args: MethodTooLong \u2014 extract_unified_scan_args runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/io/scan_options.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c3feeb19aeff02c5020cf80a9c03596b83e003608edb35d57eb5dca719c97d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_row::encode::encode_array: FunctionTooLong \u2014 polars_row::encode::encode_array runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d142ccaa6cc8430b2fc59f927edd6aa857f2c971ab2294ee92a120a5fc44f472"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuildState.finalize: MethodTooLong \u2014 finalize runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d56c65f706ea67dd8d656409eefafaaed209a076d4e5be76a8d529b67f947"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingQuery.execute: MethodTooLong \u2014 execute runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/skeleton.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc640d52893d746b94c75d94557d92dff9489d69053b1a6189ed162e44b347"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: column_selector/builder.rs: FileTooLong \u2014 539 significant 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: ColumnSelectorBuilder (2 blocks, 19-735). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"497640dc88255f0bbdc37185ebdc47754835ef5138ba0e4e823a1e0ddcf14754"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/row_deletions.rs: FileTooLong \u2014 539 significant 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 39 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":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e796c36ee19b8d5ef3dc2a730529273a16bcab7332fd857bab81d41b23abf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nodes/scalar_window.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/scalar_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"475f358d251ffb9ab34d327119d750e6fb7b753d5ee2ca97e599802abc8ea233"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handwritten_thrift/file_metadata_thrift.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322063eee65d1cd4682d41dbe01833923fbb9ca91ab8191035ef4eb26cedf764"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_row::decode::decode: FunctionTooLong \u2014 polars_row::decode::decode 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":"crates/polars-row/src/decode.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ef73eb7333946f0616c84ed0aeb353ed2c6b6ffe0c6cd23eb30cb2755b9a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EquiJoinNode.new: MethodTooLong \u2014 new 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":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d66d40d03a13407855736d89197c8e82a10bd018bf9858695d60c81aa3812b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalarColumn: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/scalar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e9bef935d8263d2b917d132e7fe26fad3fa0665d0fa273f5f587515c328d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: conversion/any_value.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7998e61bb7cb9c14cad89407d1ae4f106f1ac3c141841f41d2e6d4a222d08d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: raw/mod.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: RawTable (4 blocks, 276-782). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5648ca2c3d2a80de9bc372e9d989f64af5b41055fc2c1672c6665883d2434d32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Buffer.add: MethodTooLong \u2014 add runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ndjson/buffer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb237b212840bb3e81884b6a203b570536acee1bf9024c4b4469263939518a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::read::deserialize::binview::decode_plain: FunctionTooLong \u2014 polars_parquet::arrow::read::deserialize::binview::decode_plain runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfd629e68455b1005ab87779c2a53aae8abb98aeb78f593167bdfd2dbd68176"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_plan::plans::optimizer::join_runtime_filter::process_join: FunctionTooLong \u2014 polars_plan::plans::optimizer::join_runtime_filter::process_join runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa307d7fc4ae3095e68537ed269b4371d1b0574cde2688ff727f039a604c1bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PythonFileReader.begin_read: MethodTooLong \u2014 begin_read runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/external_python/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca45d107bf7fc38897bd5e856375058a9f00b2f33f49e4b6d8db0d3beed405"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemiAntiJoinNode.update_state: MethodTooLong \u2014 update_state runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccada7cfea8439b889d3a9c6762f23012cb9984535ab7ec18cb0acc647ba274"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RleNode.spawn: MethodTooLong \u2014 spawn runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/rle.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e754d1bac931eb14bb7bafcde8cdfc0bf9bb8fdc20f8b1ba190d047581941d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AggregationContext: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 139-997. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1aa20975225cedd744e56db0d2b24cb3cbfc24e8b01caf371bdde1b18fb5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsl/selector.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"febad804fa013a8ec618c222d90fe4f13f2d1731ca26c940c18e95ce4ace9a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/supertype.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b55fc65a9dcbba3dbfdeda06561e67881e192feb3d790ae67079ac32427233"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLContext.try_decorrelate_exists_subquery: MethodTooLong \u2014 try_decorrelate_exists_subquery runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"42295dfd4a8546f28d99fbddfc96e2a7335c6aaf0f512fa46a9b85d2304ad169"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::io_sources::parquet::projection::resolve_arrow_field_projections: FunctionTooLong \u2014 polars_stream::nodes::io_sources::parquet::projection::resolve_arrow_field_projections runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/projection.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9f158a24c973698da2efbdaf6037ed1e60613e30189ddf56dfddd5da3d4be2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EquiJoinNode.update_state: MethodTooLong \u2014 update_state runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"c548bcf187f5b2dd63d450ca7347681d4cbd217a8913532289fa35d6d7dad0de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lateral.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: SQLContext (280-747). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd08ca9665fff718d0bf0564b6789da33ec35cdeb0d3332428098bcb60481d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpillTokenInner: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 5 blocks, lines 55-941. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_token.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f66aa5dab8e55fd880225d8a87c3da2c892ea7685237720f9e67b82c8be178"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plans/options.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad0da5c0f9bca2d6c8fec97b866978f9447da4ab170888b0dff32acf8fcae2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unique/distinct.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00347d6da0fdd8a44d41e2174e7dd55689d388d176be7aa43186e6b1dfd59e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical/map.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":"crates/polars-core/src/chunked_array/logical/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccae50aa95f41bcf75f74b4611e57c7f04c8a2bb2429e5a0722e70ed7233ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Duration._parse: MethodTooLong \u2014 _parse runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e3c4162af51cb87804f2be940cf5a581100d54f4934199357f8ed6cf67a1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GatherExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/gather.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdad2c272cf5fefaebf9320a3be04d6d6085fa31627c505bcaa5835719f25a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_ops::frame::join::merge_join::gather_and_postprocess: FunctionTooLong \u2014 polars_ops::frame::join::merge_join::gather_and_postprocess runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f8c4c2af42051517b0699a3e83de852ff70b7b8ad0e078d6e6f5b72da42987"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PageDecoder.collect_nested: MethodTooLong \u2014 collect_nested runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe29a2eeb4fb4ed9e32d4c293d4bd6a831c2ca47fb8b1555723ed2e054db17b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: csv/functions.py: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c33eb6c4321b82569ec04b677969e3de1481fe29609336a08ac856fa4c2b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MapChunked: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/logical/map.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae3887fe1a223a30554364ae5cc33a604af223864e01a5e68b7f8d5a2083138"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: polars_expr::dispatch::list: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/list.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0909fe0185d1c44d4dbfce415d18e5c79234dff5a97a6ef8f1774bc33880a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: write/serialize.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78233536e9b31267e9b5e20f0cf92124a3abc5d1c3bf7e0ce0219ff12b786d61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListNumericOpHelper.try_new: MethodTooLong \u2014 try_new runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4381b681a4a273a2beca30502bf1d5592b58d202a3d5028938fe85f934127ad8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggMinMaxByExpr.evaluate_on_groups_impl: MethodTooLong \u2014 evaluate_on_groups_impl runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"952c8130eb746569c3a644d2d0b17cbbdd7792611ff2f01650e436bed6e8dd5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_ops::series::ops::unique::unique_counts: FunctionTooLong \u2014 polars_ops::series::ops::unique::unique_counts runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/unique.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d87c794d6d48a5743b59fb8c51a1e6c6160ae0c6a72b1127bb78bc2770051d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_logical_type: MethodTooLong \u2014 parse_logical_type runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"20342f623e73e1f5da1c88fa3d0432b99fb323e47f410326105856264bc0ef25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackwardFillNode.spawn: MethodTooLong \u2014 spawn runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/backward_fill.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd898357356deaac75559b4b85696d2436191ad3e701353cccae24e6e620aba7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DynamicGroupBy.spawn: MethodTooLong \u2014 spawn runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0475336c3b48cca227e03bc66150672d8e3f5c8e2d8bb82d689206cbf3a9d85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartitionMorselSender.send_morsels: MethodTooLong \u2014 send_morsels runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_morsel_sender.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178c5bfd9f51f77033508f04a7bf77867a627092550479091d5cb65ba546df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/moment.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d76d15f3a2f5ae4d96450a27ae61c9b5c49f86091f4397e6c32eb196b26e00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeTraversalImpl.traverse_rec: MethodTooLong \u2014 traverse_rec runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/traversal/tree_traversal.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecf25f63110109dc3bd2fe9882313f69aeb3e71151da3b3e8615fe76c202042"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForwardFillNode.spawn: MethodTooLong \u2014 spawn runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/forward_fill.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ecdea52f122a846ce776e5cdb0fdae6f2e255f916aa2cb8039ef3b1c1f9dec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasks/reader_starter.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e45b8cb1051ffef520ecbc21dc22e2c2f1f4d327be43661860c913d4ef30eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_parquet::arrow::read::deserialize::utils::unspecialized_decode: FunctionTooLong \u2014 polars_parquet::arrow::read::deserialize::utils::unspecialized_decode runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca73d3e346aa77f271e32d552143294a55e86b6f448cd63756ac3e347a52b3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CrossJoinNode.spawn: MethodTooLong \u2014 spawn runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/cross_join.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"974952755f73379a12175afadfa3d1a7c81277e845c86118e62552838921325f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: polars_stream::nodes::joins::merge_join::compute_join_and_send: FunctionTooLong \u2014 polars_stream::nodes::joins::merge_join::compute_join_and_send runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb33ed38de1c183128b7cc5d42a0c4e4f36b9fde285f7e4bb1cd7ac54f938459"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SortedGroupBy.spawn: MethodTooLong \u2014 spawn runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sorted_group_by.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5de840efe4bb43e422ffcd67939e2412c40d33dcb8c2cb864027699372b43f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 504 significant 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 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyo3-polars/pyo3-polars/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c099c441fe1a3c7975343a6feb1b4bf305ee4f1f308afb4cf6f4f6c19ac7f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spreadsheet/_write_utils.py: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/_write_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51fcebc0614fa69f643b4971fd514fbfef8f88c3fac70b14d80c174ea5110a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 8 shared lines): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:25-130 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:138-233 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:241-359 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:366-449 \u2014 These 4 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e777bdcbb5450c7098400072791fd6b66d5d95b4eb651b41d30c3719bcb0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 50 shared lines): crates/polars-plan/src/plans/aexpr/traverse.rs:14-97 | crates/polars-plan/src/plans/aexpr/traverse.rs:107-193 | crates/polars-plan/src/plans/aexpr/traverse.rs:228-309 \u2014 These 3 members are variants of one another: a block of 50 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e758d1c4869a179e38df01b638c4ace4a71511cbf5e0bd8fad4c098838f31d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 16 shared lines): crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:58-103 | crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:134-181 | crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:188-213 \u2014 These 3 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b539670183a4e57911308ab9bcf0c214f6be3c106f5c1d808fa151babef328b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 13 shared lines): docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs:1-62 | docs/source/src/rust/user-guide/concepts/expressions.rs:1-137 | docs/source/src/rust/user-guide/getting-started.rs:1-195 \u2014 These 3 members are variants of one another: a block of 13 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8649878cf73949af48cd2e748357526708e4bdca08676bddd6be7b70889a4138"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 5 shared lines): crates/polars-ops/src/series/ops/fused.rs:44-56 | crates/polars-ops/src/series/ops/fused.rs:95-107 | crates/polars-ops/src/series/ops/fused.rs:145-157 \u2014 These 3 members are variants of one another: a block of 5 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/fused.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"234a10dc348c6237f47208725e1041265f59657085e2fc7090c9eb7c646d67f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (298 shared lines): crates/polars-plan/src/dsl/function_expr/mod.rs:499-852 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:483-845 \u2014 These two members are variants of one another: 298 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb9749a6a2ab6f399ecc6ec2f496eeb9a8b16b19c3bdb545071819ffd363572"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (245 shared lines): py-polars/src/polars/functions/eager.py:70-378 | py-polars/src/polars/functions/eager.py:387-687 \u2014 These two members are variants of one another: 245 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":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3bc0bee2a2613a56a1dbc31bf92024928457ba2b7959019cf3007392ccf09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (215 shared lines): crates/polars-plan/src/dsl/function_expr/mod.rs:856-1091 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:877-1114 \u2014 These two members are variants of one another: 215 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"155b680de613fa95d202c7bb6e89b9b58aba9a2f208419c1d0a99d705050e6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (188 shared lines): crates/polars-parquet/src/arrow/write/mod.rs:369-813 | crates/polars-parquet/src/arrow/write/mod.rs:821-1133 \u2014 These two members are variants of one another: 188 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8e87086e9cd364640f911cb5834ae842e37b7ed35f070f79477fb55540dd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (131 shared lines): crates/polars-io/src/csv/read/streaming.rs:38-198 | crates/polars-io/src/csv/read/streaming.rs:221-383 \u2014 These two members are variants of one another: 131 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6410d81efaeb7e4d871231126cca4aaadc6ba4b195377abcc24f8946ba9dd80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (98 shared lines): crates/polars-plan/src/plans/aexpr/traverse.rs:311-421 | crates/polars-plan/src/plans/aexpr/traverse.rs:423-536 \u2014 These two members are variants of one another: 98 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e9275959778ec927b6384c76ee96a3bba373fb868136c00f48d8091200f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (97 shared lines): crates/polars-plan/src/dsl/function_expr/strings.rs:143-249 | crates/polars-plan/src/plans/aexpr/function_expr/strings.rs:331-431 \u2014 These two members are variants of one another: 97 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52b1926efb89df602cb7ebaf184210036093a217b6aa113ee486419062c0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/polars-ops/src/chunked_array/list/sets.rs:119-212 | crates/polars-ops/src/chunked_array/list/sets.rs:222-313 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sets.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfec690a75aea19d31314ed36615c0c1734f1a2ac47a211c2b3ff4a19c9d6576"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): crates/polars-ops/src/series/ops/is_in/mod.rs:344-420 | crates/polars-ops/src/series/ops/is_in/mod.rs:432-508 \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":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"56714b5fcb0c8520729d74370d7d92180d1f21d04584351f75edac4e8adb3799"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/polars-core/src/frame/group_by/aggregations/mod.rs:580-682 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:761-865 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31287894a9c04881572f88c850ac9704566e58d5062f09ec43dfe8895772123"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:222-341 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:353-505 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb7a9247b2a571171f0208205875bc52a254599b554dbdddcebb3b2f06daedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): crates/polars-expr/src/expressions/apply.rs:254-345 | crates/polars-expr/src/expressions/structeval.rs:74-158 \u2014 These two members are variants of one another: 39 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a726a365dc583c2902b8f92b5f2e06fc169b0dac9e68e258762faf0f047f4025"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): crates/polars-expr/src/expressions/eval.rs:69-242 | crates/polars-expr/src/expressions/eval.rs:251-429 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3850e7b533536a5cafcc064b86224d11aca2c53f807587124222c5e2d28a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): crates/polars-mem-engine/src/executors/group_by_dynamic.rs:26-82 | crates/polars-mem-engine/src/executors/group_by_rolling.rs:69-114 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/group_by_dynamic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b812baaf9a83a2c933d7fea04c8983aaa1a7427ef8b82e03275a7f7ee6df97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/polars-core/src/chunked_array/comparison/mod.rs:658-732 | crates/polars-core/src/chunked_array/comparison/mod.rs:902-966 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4193458717e6245485f51f2c3a121e9e673c333e64121911f835ec0df9596287"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): crates/polars-ops/src/chunked_array/list/namespace.rs:409-465 | crates/polars-ops/src/chunked_array/list/namespace.rs:474-541 \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":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec29e6655cd507e0df66017e4820e4458510cd6d4f506e8a3e36102e7c09384"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): crates/polars-ops/src/series/ops/ewm.rs:65-113 | crates/polars-ops/src/series/ops/ewm.rs:115-163 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/ewm.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6ab6010af00ab3ae8033c1df8e7efc19cb4118f711eb87b3a92bd131bba8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:219-302 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:322-378 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f5ca6a4cbec3d758a0e7e997b396aac7897aa90b6efe6e8109b430eb6bca90"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1310-1353 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1354-1398 \u2014 These two members are variants of one another: 25 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afd5e51f5d4e29c2100ce67947c38c413b4ceeef9cfe8ccbb337238ae4f7493"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): crates/polars-expr/src/dispatch/groups_dispatch.rs:83-133 | crates/polars-expr/src/dispatch/groups_dispatch.rs:140-186 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"415fdea3ce60ecce3b31e7282758f6ca9ea453aaa23a012de78356b510055136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/polars-io/src/csv/read/streaming.rs:668-714 | crates/polars-io/src/csv/read/streaming.rs:722-769 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d6ae229276a2d382871d3e6d2c7166e2a6d03c8c7472f9452a3295d2f0dcf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/polars-expr/src/groups/binview.rs:219-251 | crates/polars-expr/src/groups/binview.rs:262-292 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"133420aeeff3edee9416d63ee346fc659ddc8d19ae6cb2fd5ac1f0fc600f830d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/polars-core/src/frame/group_by/aggregations/mod.rs:334-425 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:503-575 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:684-756 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:761-865 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:866-938 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:951-1030 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1035-1109 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1113-1189 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:72-137 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:139-204 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"602f9cea331dceadc8625b90cae80d89ff3a5ae35737ba30db8bb5cf126695d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/polars-sql/src/subquery.rs:2120-2195 | crates/polars-sql/src/subquery.rs:2919-2959 | crates/polars-sql/src/subquery.rs:3054-3199 | crates/polars-sql/src/subquery.rs:3414-3502 | crates/polars-sql/src/subquery.rs:3662-3690 | crates/polars-sql/src/subquery_group_by.rs:62-118 | crates/polars-sql/src/subquery_pull_up.rs:142-229 | crates/polars-sql/src/subquery_pull_up.rs:1279-1324 | crates/polars-sql/src/subquery_pull_up.rs:1327-1354 | crates/polars-sql/src/subquery_pull_up.rs:1422-1463 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0755b52aaae39e943fd738fd7b4c86de32a8b9305b47cbc152168e096ad3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/polars-expr/src/reduce/any_all.rs:90-101 | crates/polars-expr/src/reduce/any_all.rs:189-200 | crates/polars-expr/src/reduce/any_all.rs:301-314 | crates/polars-expr/src/reduce/any_all.rs:427-440 | crates/polars-expr/src/reduce/bitwise.rs:214-227 | crates/polars-expr/src/reduce/is_empty.rs:91-102 | crates/polars-expr/src/reduce/min_max.rs:493-506 | crates/polars-expr/src/reduce/min_max.rs:609-622 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"858fbc4a854e3e42f1344d2cf3d4b7a953ab4ac3c2125d0b08f336e0c9111768"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/polars-expr/src/reduce/any_all.rs:63-83 | crates/polars-expr/src/reduce/any_all.rs:162-182 | crates/polars-expr/src/reduce/any_all.rs:268-294 | crates/polars-expr/src/reduce/any_all.rs:394-420 | crates/polars-expr/src/reduce/bitwise.rs:184-207 | crates/polars-expr/src/reduce/min_max.rs:463-486 | crates/polars-expr/src/reduce/min_max.rs:579-602 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f076f0bc159693245de33e7fb9d943f37492c0dd66818d7dc853dd4674ee05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/polars-ops/src/chunked_array/array/dispersion.rs:6-39 | crates/polars-ops/src/chunked_array/array/dispersion.rs:41-74 | crates/polars-ops/src/chunked_array/array/dispersion.rs:76-111 | crates/polars-ops/src/chunked_array/list/dispersion.rs:5-48 | crates/polars-ops/src/chunked_array/list/dispersion.rs:50-84 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:224-266 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa07dd2506e6a5e8da7960a8e50dacc82f0848e72c55edc9f2528432f7fcae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): py-polars/src/polars/io/csv/functions.py:124-531 | py-polars/src/polars/lazyframe/engine.py:503-525 | py-polars/src/polars/lazyframe/engine.py:593-623 | py-polars/src/polars/lazyframe/frame.py:2480-2713 | py-polars/src/polars/lazyframe/frame.py:3597-3850 | py-polars/src/polars/lazyframe/frame.py:9542-9704 \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":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a57ab9ccb2ab8930d270a8ea2a6e6e6b25b0277fdd7b902e7b997e3e38e197d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/polars-core/src/frame/builder.rs:94-111 | crates/polars-core/src/frame/builder.rs:122-145 | crates/polars-core/src/frame/builder.rs:157-180 | crates/polars-core/src/frame/builder.rs:194-216 | crates/polars-core/src/frame/builder.rs:223-250 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/builder.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a05b4d399b688b85452962c24588e026196c908487e39dbced675ca89893e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/polars-expr/src/reduce/count.rs:59-88 | crates/polars-expr/src/reduce/count.rs:96-125 | crates/polars-expr/src/reduce/count.rs:229-256 | crates/polars-expr/src/reduce/has_nulls.rs:49-78 | crates/polars-expr/src/reduce/is_empty.rs:56-84 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/count.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"658c722f64b4b1286e4cd1597b0bf42a48ff3a185242cf71a07c5745c91db9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-compute/src/unique/distinct.rs:582-625 | crates/polars-compute/src/unique/distinct.rs:627-674 | crates/polars-compute/src/unique/distinct.rs:752-782 | crates/polars-compute/src/unique/distinct.rs:784-815 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f64b22186348253c44fdb66159a5ee0889d4ee90b524a6de697434b106a9a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-expr/src/dispatch/struct_.rs:33-48 | crates/polars-expr/src/dispatch/struct_.rs:54-74 | crates/polars-expr/src/dispatch/struct_.rs:76-91 | crates/polars-expr/src/dispatch/struct_.rs:93-108 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/struct_.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"129e782f1a542ff4386aede24a129d3ce0d181990aa157a16b20fb766bc18f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-expr/src/reduce/mod.rs:426-461 | crates/polars-expr/src/reduce/mod.rs:469-507 | crates/polars-expr/src/reduce/mod.rs:690-716 | crates/polars-expr/src/reduce/mod.rs:724-755 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a13c86edad4dc7a4dc034247f34618b11baf342af61f9ee90925b58fe97bd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-io/src/csv/write/write_impl/serializer.rs:206-222 | crates/polars-io/src/csv/write/write_impl/serializer.rs:237-254 | crates/polars-io/src/csv/write/write_impl/serializer.rs:271-288 | crates/polars-io/src/csv/write/write_impl/serializer.rs:305-321 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad764a98b9416f019a3b6479a7c1faf60744734842c3b0f21e524414af543918"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-ops/src/chunked_array/array/join.rs:9-40 | crates/polars-ops/src/chunked_array/array/join.rs:46-85 | crates/polars-ops/src/chunked_array/list/namespace.rs:74-104 | crates/polars-ops/src/chunked_array/list/namespace.rs:110-146 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/join.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d84e49a605a3a9dbeeb45d96394ff194ffee33c9e3dab86fa5f7f9f029dbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-ops/src/frame/join/asof/groups.rs:212-295 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:25-130 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:138-233 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:241-359 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/groups.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6ad820b9227c1ff0bfa0dde1cb38e32040f2a3030b8952c7943c8693710ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-ops/src/series/ops/log.rs:79-99 | crates/polars-ops/src/series/ops/log.rs:102-122 | crates/polars-ops/src/series/ops/log.rs:125-153 | crates/polars-ops/src/series/ops/log.rs:156-184 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/log.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"25548d61841e0a3c541b379489cb453d0e2cd972a5d87a214de7f026eaa558c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs:30-45 | crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:40-68 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:41-61 | crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:37-62 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acc6d49feed3b766328c4ce50f7c9133b68cd1e2049a5a1ea3ba24a98163db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-parquet/src/arrow/read/deserialize/categorical.rs:260-273 | crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:221-234 | crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:195-208 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:309-322 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/categorical.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d94dc9d2d4d71906ad56021a35f113555d293b47bc9c00926203ce3d2b78ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-parquet/src/arrow/write/binary/nested.rs:22-51 | crates/polars-parquet/src/arrow/write/binview/nested.rs:18-47 | crates/polars-parquet/src/arrow/write/boolean/nested.rs:17-44 | crates/polars-parquet/src/arrow/write/fixed_size_binary/nested.rs:17-38 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/nested.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a3b130bbbc104534608555efb3890c9458f72867b32653523f36e657a80741"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-sql/src/context.rs:5024-5103 | crates/polars-sql/src/context.rs:5113-5182 | crates/polars-sql/src/context.rs:7358-7415 | crates/polars-sql/src/sql_visitors.rs:750-785 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa98f3014cc31ba46028d29b789557d83d36c7a7fd8efd13370ed393b7aeca49"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-sql/src/subquery.rs:348-402 | crates/polars-sql/src/subquery.rs:1662-1884 | crates/polars-sql/src/subquery.rs:1896-2078 | crates/polars-sql/src/subquery.rs:2303-2434 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea05319c0c43b304e20145dacf2e0664bc4570f7f8e7fb5abe4c962aec0ed0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-sql/src/subquery_outer_select.rs:39-107 | crates/polars-sql/src/subquery_pull_up.rs:142-229 | crates/polars-sql/src/subquery_pull_up.rs:417-473 | crates/polars-sql/src/subquery_pull_up.rs:577-645 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_outer_select.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b57e5ce9d5f368cfcfe3e928c44a7e163359ddbb3eee2c03956bdb02ea4bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-stream/src/nodes/dynamic_group_by.rs:317-459 | crates/polars-stream/src/nodes/rolling_fixed_window.rs:177-272 | crates/polars-stream/src/nodes/rolling_group_by.rs:258-392 | crates/polars-stream/src/nodes/sorted_group_by.rs:151-300 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30bdc258e39c591ed3ffa73d163ae3f514a5dd107f7f7917223deeecc4a302"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-stream/src/nodes/forward_fill.rs:62-214 | crates/polars-stream/src/nodes/gather_every.rs:55-118 | crates/polars-stream/src/nodes/sorted_unique.rs:74-173 | crates/polars-stream/src/nodes/with_row_index.rs:51-99 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/forward_fill.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a735cdd69e946f492f63790793899546c2ba44f72edef0a7e6276807de2194"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/polars-time/src/chunkedarray/datetime.rs:42-61 | crates/polars-time/src/chunkedarray/datetime.rs:63-82 | crates/polars-time/src/chunkedarray/datetime.rs:101-120 | crates/polars-time/src/chunkedarray/datetime.rs:170-189 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/datetime.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8783b2807b7c9ea07b00b0e85b99098e42e5f3986799d056b7d54e381b9a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): py-polars/src/polars/expr/list.py:1542-1581 | py-polars/src/polars/expr/list.py:1584-1625 | py-polars/src/polars/expr/list.py:1628-1665 | py-polars/src/polars/expr/list.py:1668-1707 \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":"py-polars/src/polars/expr/list.py"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb518cc140840949524f3ac8dc43b22f7fcaf36ea41b36ca6e808e8260ff27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (236 corresponding lines): crates/polars-plan/src/dsl/serializable_plan.rs:208-443 | crates/polars-plan/src/dsl/serializable_plan.rs:497-735 \u2014 These two members are one piece of code written twice and then edited apart: 236 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/serializable_plan.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4963f4f35044427a1f120894afdff48777b11ff1874e4f8b666a3cfcd3fb6e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (159 corresponding lines): crates/polars-python/src/conversion/mod.rs:250-418 | pyo3-polars/pyo3-polars/src/types.rs:338-496 \u2014 These two members are one piece of code written twice and then edited apart: 159 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6f1faee7af1507a78aa8ab6264212b2e3e1e478f06855ecbf8a75a78906f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (111 corresponding lines): crates/polars-core/src/frame/row/av_buffer.rs:168-278 | crates/polars-core/src/frame/row/av_buffer.rs:673-792 \u2014 These two members are one piece of code written twice and then edited apart: 111 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac2bd916f7aa5e3bfe1ac8a5cb6ee0c34940fd6b312e8597725aeef8259b964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (132 corresponding lines): crates/polars-ops/src/chunked_array/gather/chunked.rs:490-621 | crates/polars-ops/src/chunked_array/gather/chunked.rs:694-841 \u2014 These two members are one piece of code written twice and then edited apart: 132 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"226b168133fce65630251626f8b54353f09a6733148a9e91ce489a9c55201b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (150 corresponding lines): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:712-861 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1122-1273 \u2014 These two members are one piece of code written twice and then edited apart: 150 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a33f69daea4eed94c430652fe0e066713ed9be125eef10d9659703c24304f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): crates/polars-ops/src/chunked_array/gather/chunked.rs:158-251 | crates/polars-ops/src/chunked_array/gather/chunked.rs:258-351 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9162c533a9276d4f1ce2e00a267489030b47a2c5965fb07c7194ffa2afff04b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (123 corresponding lines): crates/polars-io/src/csv/read/streaming.rs:402-524 | crates/polars-io/src/csv/read/streaming.rs:538-661 \u2014 These two members are one piece of code written twice and then edited apart: 123 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a83049fd818c76c22920ca15651d453863ea6205e5b44c2fd7e0536aec326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): crates/polars-ops/src/chunked_array/strings/find_many.rs:165-242 | crates/polars-ops/src/chunked_array/strings/find_many.rs:263-339 \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":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5822da57cee98de37bb768f1ec96479df57bc5e275b69264bd0401e95ef2622e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/polars-expr/src/hot_groups/mod.rs:77-122 | crates/polars-expr/src/idx_table/mod.rs:88-132 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c31fc6ab2d75bc82c98e7109070e73c1aa21bdb43db794ef8e399e91cceb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): crates/polars-ops/src/chunked_array/binary/slice.rs:108-169 | crates/polars-ops/src/chunked_array/strings/substring.rs:238-304 \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":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec2cf15a80f06018e5a7b58000d74b6be6d1e5f5ad759dce9cc4ec81d7901b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:43-94 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:127-178 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"153e3e40135c59fdf8f1846003f7d323cd882e11e397cc7417f5aed61f319ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): crates/polars-ops/src/frame/join/asof/groups.rs:371-470 | crates/polars-ops/src/frame/join/asof/mod.rs:328-391 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/groups.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2863d14dafabf5c95bb0d801eb4f15df83389873ab1baa78863d95b121c243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/polars-expr/src/reduce/min_max.rs:20-57 | crates/polars-expr/src/reduce/min_max.rs:62-99 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8589410d3a77abf2c0e43bf3aed11220c1042cf3d0d77fbf95ae99de22f6dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:92-162 | crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:174-264 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"349a38c2851020b0b1328fdfc37f98f8feb2dc7ecafd0a8c72057a7adaa5b898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/polars-ops/src/series/ops/is_first_distinct.rs:91-148 | crates/polars-ops/src/series/ops/is_last_distinct.rs:12-69 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f409d0adf40a02daab5db56783c0d72ac1bc92e03b214401030e596372cbff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/polars-ops/src/chunked_array/strings/split.rs:164-226 | crates/polars-ops/src/chunked_array/strings/split.rs:309-392 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1cd82d95fe11e3c526e2f43529719db87ec5934613360a9303316f19033f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/polars-expr/src/reduce/min_max_by.rs:24-81 | crates/polars-expr/src/reduce/min_max_by.rs:87-156 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f2ef22c887b9948b5c76ab962210749e9cf38879cf7dcc44965cf3dc8f899"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:369-422 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:425-480 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde28bee8de28a91254bf90867934d68bf10b92e82410aaae97ec7c3e1853df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/polars-ops/src/series/ops/cut.rs:13-68 | crates/polars-ops/src/series/ops/cut.rs:76-133 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cut.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"091023dc6d526aca6f2532926d4d7e66f0cd4da7102f81e396d25bcfc7408bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/polars-plan/src/plans/ir/inputs.rs:176-216 | crates/polars-plan/src/plans/ir/inputs.rs:218-258 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"529ed76d8f82a4f808f4503c9fafe54e4f8ed1cba2b1cb9ce69d80aa9c9395f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/polars-ops/src/series/ops/cum_agg.rs:388-425 | crates/polars-ops/src/series/ops/cum_agg.rs:436-473 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"403d6663fabf54b398a14109e67800c244a711f5df76ec98e217c7c67bf2baa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/polars-ops/src/series/ops/abs.rs:4-39 | crates/polars-ops/src/series/ops/negate.rs:3-35 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/abs.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1237264302114137ec32c33112801c87f17e5e6556255f1071b1251be4fe3f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (246 corresponding lines): py-polars/src/polars/dataframe/frame.py:4933-5178 | py-polars/src/polars/lazyframe/frame.py:2756-3051 \u2014 These two members are one piece of code written twice and then edited apart: 246 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"016a85b712679bcf6d1b6a846a7acc535b2d176256dea8d78218d58a48a2dc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): crates/polars-plan/src/plans/ir/inputs.rs:37-98 | crates/polars-plan/src/plans/ir/inputs.rs:100-166 \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":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd0517bd56f5e2b419e8ff675e3bbede60181c97263356aa95bce9625655e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/polars-compute/src/unique/distinct.rs:484-536 | crates/polars-compute/src/unique/distinct.rs:538-580 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde4d5f565219eaca9ac9dc5724a29691bdbfe99a3d9e8688b7a8807529cd834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 28\u002B corresponding lines): crates/polars-ops/src/chunked_array/array/sum_mean.rs:33-61 | crates/polars-ops/src/chunked_array/list/min_max.rs:46-74 | crates/polars-ops/src/chunked_array/list/min_max.rs:164-192 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:43-71 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:195-222 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/sum_mean.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1675e8841c21ddf14cb2f9c1127f445b5adba8e6ad8d0ffd3fe48e2bd8bacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/polars-ops/src/chunked_array/list/min_max.rs:76-121 | crates/polars-ops/src/chunked_array/list/min_max.rs:194-239 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7753048a4abd3d34b6ba0df58104beef7a844e8ef7803726395090bfc8795b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:83-138 | crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:140-186 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe0af5e0c9e6325c28f3dc1a5dbec866889d086373613d44f8018291b36ef08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/polars-io/src/cloud/credential_provider.rs:794-866 | crates/polars-io/src/cloud/credential_provider.rs:979-1029 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/credential_provider.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea319210f1f59783be2fbeae270f598a7ddfdf3acfd3a097a3fb2d58f31f46f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/polars-ops/src/chunked_array/array/to_struct.rs:16-64 | crates/polars-ops/src/chunked_array/list/to_struct.rs:15-60 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/to_struct.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3977d46634389f33d8876398007c71b6545cccf86577de0a6a4a911d7db6e4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/polars-ops/src/series/ops/clip.rs:81-114 | crates/polars-ops/src/series/ops/clip.rs:117-150 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472e9a9e0e1fb821e1ef924032f05f96743df11ba931cd6e82ed52349c21789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/polars-plan/src/dsl/function_expr/list.rs:58-108 | crates/polars-plan/src/plans/aexpr/function_expr/list.rs:233-283 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/list.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d16bb01643ec8559e396da951d0820c16c643299f8dae80af2e3a02457ac919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/polars-ops/src/series/ops/arg_min_max.rs:51-83 | crates/polars-ops/src/series/ops/arg_min_max.rs:85-117 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/arg_min_max.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a058f33b58ca7627fc37e4df887f5d82fdf7b6a6a5125df4c9032083fad7a497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/polars-ops/src/series/ops/cum_agg.rs:114-154 | crates/polars-ops/src/series/ops/cum_agg.rs:156-196 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a0e1a9eaad70b49129b9286b7d21d3abeac765327b144d606c25bb07f3276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/polars-ops/src/series/ops/round.rs:330-369 | crates/polars-ops/src/series/ops/round.rs:372-411 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc30711251728608eed57a3b879cf987d62b7dfb740e5c292c075e66a3ffd107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/polars-core/src/chunked_array/arg_min_max.rs:167-206 | crates/polars-core/src/chunked_array/arg_min_max.rs:212-251 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75960b513b43c06bde0e9c8f20255ef187927e9b1b2354542884a58c04c715e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:499-544 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:501-559 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ce8652b1da000101beff17653d0a258eb5c985d48fbd0d09e9db0b0b81e4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/polars-ops/src/series/ops/linear_space.rs:11-46 | crates/polars-ops/src/series/ops/linear_space.rs:54-89 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/linear_space.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"920bd3725fb4048fbe685f369c0a820e666a0121d0158cfc08dfc8a6a16f83de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:858-892 | crates/polars-core/src/chunked_array/ops/arity.rs:908-942 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fdb0b6c88dcff7c1a2c9741932efd08a41fe69c6a6acca48e8977ec0aa2160"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/polars-compute/src/arithmetic/mod.rs:167-207 | crates/polars-compute/src/cast/primitive_to.rs:100-136 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/arithmetic/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636781f6560da0b1daebb28ead947c5fbb91bd0e73a16129a7ee921d9dde016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/polars-core/src/frame/mod.rs:1261-1299 | crates/polars-core/src/frame/mod.rs:1309-1350 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9593a6b005451990cddd8c9c851eaf566df74fcc64eefa5b0f8776b23356816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/idx_table/binview.rs:129-172 | crates/polars-expr/src/idx_table/single_key.rs:180-191 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"202bc4e0b87f4fed1d48d7cad2f5cffd0479fd5f78e4150475918398551a4ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:346-402 | crates/polars-core/src/series/arithmetic/list.rs:338-416 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b264fa19ffe35d8621b75995a39d19f46083c13719aaf4516ab6739d2ac846ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/polars-compute/src/if_then_else/mod.rs:147-187 | crates/polars-compute/src/if_then_else/mod.rs:199-244 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/if_then_else/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f097d1f44a3f41f59de05cd766f3c5dc2b9a048f48bc22890b139f680fcc991d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/polars-ops/src/chunked_array/scatter.rs:45-85 | crates/polars-ops/src/chunked_array/scatter.rs:90-130 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/scatter.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1d4b1491ab6ad335386e52353072f443e71a5f05c840448931d7f1ca15f3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:37-79 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:86-135 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbccfee74aaed914cf2385af601de41ebab8a3f37b1d5d7f6703053c8d3d113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-stream/src/nodes/top_k.rs:393-427 | crates/polars-stream/src/nodes/top_k.rs:533-575 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d0678db76643dc1b224fb3c3a5ce47293194116794f6020a26b7ca7c2db03f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/polars-expr/src/dispatch/horizontal.rs:85-130 | crates/polars-expr/src/dispatch/horizontal.rs:139-175 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d0d027be8674a3a6ce08eaf7a9c9a5e6ac069d1166d909351c984046efb1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/polars-expr/src/dispatch/strings.rs:643-701 | crates/polars-expr/src/dispatch/strings.rs:709-757 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb28f37a63698b5d795f9d70fd561168eace18fa2e71bb696a7ab6258ba124c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-core/src/series/arithmetic/borrowed.rs:607-637 | crates/polars-core/src/series/arithmetic/borrowed.rs:648-674 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fdaea1e19e4aa0cab21f3c63bf6216dd955ed8622e838a41e63095d1f42a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/polars-core/src/chunked_array/comparison/categorical.rs:136-166 | crates/polars-core/src/chunked_array/comparison/categorical.rs:175-216 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/categorical.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"52570a02016a8b4d5906f6fb5fbef188057cd1decd08420bbf36013b9d81c542"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): crates/polars-time/src/windows/group_by.rs:291-334 | crates/polars-time/src/windows/group_by.rs:349-390 | crates/polars-time/src/windows/group_by.rs:422-465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc825e4c1376e0f2c355598182260f4f3260f23ae5fee7627d60855d6c964877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): crates/polars-compute/src/boolean.rs:48-112 | crates/polars-compute/src/boolean.rs:115-178 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/boolean.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f16b7e5e445c56caca497ba9ae8dc0dc94661dbc5d09aed14c083fdfd6a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-ops/src/chunked_array/gather/chunked.rs:849-883 | crates/polars-ops/src/chunked_array/gather/chunked.rs:890-933 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3274339c7be24f41f027be716b67d6b2a1dbe2cbb04ea7e9e381e26a19f31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/polars-expr/src/groups/row_encoded.rs:128-168 | crates/polars-expr/src/groups/row_encoded.rs:179-210 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/row_encoded.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2810e922099fee0a8ec1d9c8826b2cb06ead32cb5bef7b77500b3d4fb9a6910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/polars-core/src/frame/group_by/hashing.rs:131-173 | crates/polars-core/src/frame/group_by/hashing.rs:185-237 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/hashing.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0833c18cc7dc4421ed9a0e389778e5e2f099008e4a3bfb282d03c3723233c027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/polars-io/src/cloud/options.rs:629-683 | crates/polars-io/src/cloud/options.rs:704-753 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3955fbcddd8e94ee09aa2aaa518e225feddd80e7f7d74853da4b694e7063502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/polars-core/src/frame/column/scalar.rs:242-279 | crates/polars-core/src/frame/column/scalar.rs:290-325 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/scalar.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1424048b06d840b699b96181431733931ba1408dc54075b064cd0a735ab28e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:105-152 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:99-143 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dedd813e005f00a10a8b581b35aed061c8943006b1a8b59364fe38b26ac5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/polars-parquet/src/arrow/write/binary/basic.rs:66-114 | crates/polars-parquet/src/arrow/write/binview/basic.rs:69-111 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b104e64ad5bd8b8905e2a583562368b68ca74662e1ab5aced945909ee5019d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-compute/src/unique/distinct.rs:688-720 | crates/polars-compute/src/unique/distinct.rs:722-750 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9bdb33b8ae798816f76ee7ec0f43fc9c656e58578a4c6bcf1dd524c51d1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/mod.rs:155-189 | crates/polars-parquet/src/arrow/write/mod.rs:1135-1183 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"39751c244f97eb3f16bf390e5468985164a25094bb811f15387a904ccdd53a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-plan/src/plans/lit.rs:252-280 | crates/polars-plan/src/plans/lit.rs:282-310 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/lit.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51d4208c00cc27a42161fbb7c866c322067ae3d9dd563e8601134314418aeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-expr/src/reduce/first_last.rs:425-447 | crates/polars-expr/src/reduce/first_last_nonnull.rs:410-439 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56fb62d656667cbc4d9df630f6d16acaef18e84deba850e5a2038e56b5e0204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-ops/src/series/ops/rolling.rs:44-70 | crates/polars-ops/src/series/ops/rolling.rs:114-143 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rolling.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24308f03bebf1bfe30b22de37e63f54305dd26023a488f81291cf3249cc38fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 40\u002B corresponding lines): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:106-164 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:189-228 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:587-643 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4788a98a5a02fd7fdb1c4d07d618b09263a376788478ce661eb31f8f4ee01f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/polars-expr/src/reduce/unique.rs:238-268 | crates/polars-expr/src/reduce/unique.rs:414-448 | crates/polars-expr/src/reduce/unique.rs:509-541 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/unique.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c1d51e7890e2c0db42d1bd9e476ca4000af8d3e9fa9d84c96fbf8ee6afd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:40-80 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:38-74 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574735a93655e1d89d378d92f86e8ba9909a70d97e09b528f1f7f24027c560b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/polars-expr/src/dispatch/groups_dispatch.rs:194-221 | crates/polars-expr/src/dispatch/groups_dispatch.rs:229-256 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a8318652682bd967123d3197d3a9cd69dc1a1d59e5c9722d7905d2f359415d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/polars-stream/src/nodes/sort/flush.rs:224-258 | crates/polars-stream/src/nodes/window/flush.rs:207-238 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/flush.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3d54258e53f0d77d46e36c603cc58eb753f408503af5e9b81162f538616492"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/polars-row/src/fixed/decimal.rs:70-107 | crates/polars-row/src/fixed/decimal.rs:115-155 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/fixed/decimal.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2125f8de1a0728811badd6def3f4c6ec5f3919fe5046ee77034f3334e7b5950c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-json/src/json/deserialize.rs:43-60 | crates/polars-json/src/json/deserialize.rs:391-411 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2279810b7c82c55ac3556ab0324ebdebfe15ed6c4f42537ce7e2b403a4b59d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:18-37 | crates/polars-ops/src/frame/join/hash_join/sort_merge.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":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"296f4ccb5e495845dfb0b15369bfd7069691cc8e043d041680c647aebe38d0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/polars-core/src/frame/row/av_buffer.rs:594-627 | crates/polars-core/src/frame/row/av_buffer.rs:633-670 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85ea14d3b523223fa2e86e331b01cd3f99a1c14170de416a5b8623cbb4a96ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-compute/src/moment.rs:368-396 | crates/polars-compute/src/moment.rs:517-555 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafad5d25f84e99cab24ab429618e35e419cf2bb9f834e31a2cef1cf29d64d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/polars-stream/src/nodes/in_memory_map.rs:43-78 | crates/polars-stream/src/nodes/is_sorted.rs:176-211 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_map.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a4f7d67958fc06ed02b225959602ed1847a5a26aa2462bf8eda2666904c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/polars-ops/src/chunked_array/strings/namespace.rs:616-649 | crates/polars-ops/src/chunked_array/strings/namespace.rs:657-690 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"26135de5ba0e96462223b52819792a97f6bcb7c6a99f4adc777c3aafda62c8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:105-144 | crates/polars-stream/src/nodes/io_sources/lines.rs:97-142 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:104-141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2deddc379bbe40b0a11c63da17ee27a26b3dd20a6d0c328b9df89f26d7932bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/polars-core/src/utils/mod.rs:929-974 | crates/polars-core/src/utils/mod.rs:985-1014 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"066c93118fbcbbc4f0b379e25207deeb3af4f206f61f7f3b552239eeda3aa73d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/polars-sql/src/group_context.rs:223-264 | crates/polars-sql/src/group_context.rs:414-450 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/group_context.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b376a1bb622db0ff2847a91d890f1d896fb650749f093a914e5e3392e10b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:26-73 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/morsel_serializer.rs:27-72 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f6ceb73cd537a6b45db68d16acc4e78212dacdb84819480c538aa82753efed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/polars-expr/src/dispatch/groups_dispatch.rs:982-1031 | crates/polars-expr/src/dispatch/groups_dispatch.rs:1039-1082 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"191fdff6963a2fa986f131a30b894dc3009ab6d7c734e88c42d0dc55e906f35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-stream/src/nodes/group_by/flush.rs:138-162 | crates/polars-stream/src/nodes/joins/equi_join/flush.rs:253-276 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/flush.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ae1ffe00b4a59fc5f27c6791ffde26aec6c3ab2425df1a317a4d79c5ab8960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-row/src/encode.rs:243-268 | crates/polars-row/src/encode.rs:276-300 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ebe7796c32f39fc795f94e0eeca30e6fa4b310a1b51ac38a9d776f5121c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/polars-core/src/series/arithmetic/borrowed.rs:546-568 | crates/polars-core/src/series/arithmetic/borrowed.rs:574-596 | crates/polars-core/src/series/arithmetic/borrowed.rs:685-704 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75d92af05a1130f46c5b68228989eae89b55ae0676de608e30e45fef9682d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-core/src/frame/mod.rs:1159-1188 | crates/polars-core/src/frame/mod.rs:1191-1217 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c017708976068dfde0c730be461e63b7b37566377fcf51081010dccb0076d487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/polars-ops/src/series/ops/fused.rs:12-28 | crates/polars-ops/src/series/ops/fused.rs:63-79 | crates/polars-ops/src/series/ops/fused.rs:113-129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/fused.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d075a6142a02c7a6df401c748324ce9ab9705a7de86a82f38c575ca1102d9f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-core/src/datatypes/dtype.rs:1262-1283 | crates/polars-core/src/datatypes/dtype.rs:1286-1307 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4773980c1d6337d4e9068089a1ac58fa135e3a7fae825606fa8c3a40e4a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/polars-utils/src/cache.rs:157-186 | crates/polars-utils/src/cache.rs:206-237 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/cache.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b001db42ac8c1c05744e3efd89114313b6bdabe8875325d87523cf2102ca214c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/polars-expr/src/idx_table/row_encoded.rs:123-158 | crates/polars-expr/src/idx_table/row_encoded.rs:165-197 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/row_encoded.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"727c0bc869660367d0ec02072ad378911529f4b25572c21cea7287fe7e9d59d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/polars-expr/src/reduce/implode.rs:88-113 | crates/polars-expr/src/reduce/implode.rs:158-181 | crates/polars-expr/src/reduce/implode.rs:227-255 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/implode.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4c2553325253cd2d18b4d1d46e8cd2b42399431a42ddf1b2f88da9c9b23693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/polars-expr/src/dispatch/pow.rs:42-70 | crates/polars-expr/src/dispatch/pow.rs:81-106 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/pow.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c3f29460807408b4df2261a2d4823133eabef5a245864851e4933e42c41542"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs:370-396 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs:400-426 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb18c2356a244dc35e4639455acf3d8ab99301bd3bc1152610763fd80b8561fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/polars-core/src/series/mod.rs:705-719 | crates/polars-core/src/series/mod.rs:722-736 | crates/polars-core/src/series/mod.rs:739-753 | crates/polars-core/src/series/mod.rs:756-770 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"020704895e32f479f93550a5e439ac978a602faaaff294c2d4b160614f060d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-plan/src/plans/optimizer/recursive_caches.rs:94-122 | crates/polars-stream/src/physical_plan/lower_ir.rs:2311-2342 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/recursive_caches.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc66ec3fd0fb1af8c2b27f9b47d66e7aca8bee25570f5f4140ff97fc94ae44d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-plan/src/dsl/file_scan/field_selection.rs:193-217 | crates/polars-plan/src/plans/optimizer/projection_pushdown/field_pruning.rs:1461-1487 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/field_selection.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488425244a510e3dace8c6e2a7c30c866af4d9df7ddce4f0d36dee09454a32b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-json/src/json/deserialize.rs:123-144 | crates/polars-json/src/json/deserialize.rs:149-170 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1223f7455c769cb3e7bd764853113315b0bcabb9dd907dc00afb22aa71ffa2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-expr/src/reduce/first_last.rs:454-474 | crates/polars-expr/src/reduce/first_last_nonnull.rs:446-466 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb74d0c63b97e750a778bdef117bbe6f90b8f845322b38e700a4c5b2592396d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-compute/src/unique/distinct.rs:383-415 | crates/polars-compute/src/unique/distinct.rs:444-470 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"28be5086c502ef57ce59fc05a278f1cb3d23d9d29e1a2c72f93b48c5bb1b0f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-core/src/frame/column/mod.rs:1827-1846 | crates/polars-core/src/frame/column/mod.rs:1869-1886 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46f3ebe22943244e4e74a886b2f694e78f3809bef430521333d3d88baafb313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-compute/src/comparisons/array.rs:39-66 | crates/polars-compute/src/comparisons/array.rs:68-92 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/array.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"44972d965d37ce8ee864cc34604c0ff0b2b83712acf7e6efe5c735c46591ffb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): crates/polars-ops/src/chunked_array/binary/slice.rs:171-193 | crates/polars-ops/src/chunked_array/binary/slice.rs:195-217 | crates/polars-ops/src/chunked_array/strings/substring.rs:306-331 | crates/polars-ops/src/chunked_array/strings/substring.rs:333-359 \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":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae09f0894cfdd52a8aedc80649915892fc3d6acec67769f40463a79b6ba823ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/polars-ops/src/chunked_array/gather/chunked.rs:364-397 | crates/polars-ops/src/chunked_array/gather/chunked.rs:404-437 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62f729da673f0bad3a5463c6c5e14dea67cfe00f86c70fd8ab979bfb6f1c5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-ops/src/series/ops/horizontal.rs:127-151 | crates/polars-ops/src/series/ops/horizontal.rs:153-177 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/horizontal.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"da332021bac34f0f8520e35838469851013ea9de063f56b05d26d7dbef75a913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-plan/src/plans/builder_ir.rs:89-119 | crates/polars-plan/src/plans/builder_ir.rs:126-152 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/builder_ir.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c89a093b9db2e73b81ad92ac787914e8e2592d9cb712dead19eb194bfe565b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-python/src/functions/io.rs:121-144 | crates/polars-python/src/functions/io.rs:158-172 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/io.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68112ba24c19f787c9e62bc54282d32272a2524c25c9db7f4c5ec62a554f97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/polars-row/src/variable/no_order.rs:228-257 | crates/polars-row/src/variable/utf8.rs:276-306 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d23cd3fa7756b4328389bd397b3deea0867c6d6eb509f317ece3a456940624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-stream/src/execution_order.rs:39-73 | crates/polars-stream/src/execution_order.rs:81-109 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execution_order.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7e1fa6a0283fa7ea08f46fe52821e937d398f81b4288c814f345669eff43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-row/src/variable/no_order.rs:139-162 | crates/polars-row/src/variable/utf8.rs:154-180 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ae13fcbbb28419898579def4d5962997586c50648260b02a09d89c3ffd86a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:262-286 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:290-318 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a63badd452757e9cf7686cf8130668e0ab4cf06c8db8a253a284fc5c0234761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-expr/src/dispatch/rolling.rs:15-36 | crates/polars-expr/src/dispatch/rolling_by.rs:11-33 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/rolling.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"db97fdb35802b6f99aa2e330410ee0d9010c69d025db8690cf5514c6d9381a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-parquet/src/arrow/write/binary/basic.rs:120-146 | crates/polars-parquet/src/arrow/write/binview/basic.rs:117-141 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa36950b8aebe66c594af42a525b78f7a030ea334d6f6fe1d324dd18f45ee76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:404-434 | crates/polars-core/src/series/arithmetic/list.rs:418-448 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb380450ffa8176571b8ff732365ccbe042ebff9fefcc0d97457ce214e42d83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:736-763 | crates/polars-core/src/series/arithmetic/list.rs:938-961 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd5209c3bf9b330212a8be257b032b17fd8a712ed01d1471d902273128047e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): crates/polars-core/src/series/comparison.rs:422-436 | crates/polars-core/src/series/comparison.rs:438-456 | crates/polars-core/src/series/comparison.rs:458-472 | crates/polars-core/src/series/comparison.rs:474-488 | crates/polars-core/src/series/comparison.rs:494-510 | crates/polars-core/src/series/comparison.rs:512-528 | crates/polars-core/src/series/comparison.rs:530-546 | crates/polars-core/src/series/comparison.rs:548-564 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/comparison.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e429a6cde3226144d73499c86dd44bcad3b940ba6c00165b63b9d8534caf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-compute/src/moment.rs:650-667 | crates/polars-compute/src/moment.rs:673-690 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14af3c24d6567b667349fd9c13444df03d58c23be7db4d4b30246d3d86ea099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:68-103 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:546-584 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2373d6bb95aa43ffa14482e22228394ea9d272fa172fad9eb7b1c986ade9f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/polars-expr/src/expressions/group_iter.rs:94-119 | crates/polars-expr/src/expressions/group_iter.rs:124-149 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/group_iter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e977a928526ff7e1a85f9e48339607cd4ce8ffcc970b9ea0cd7db53fb5686d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/polars-plan/src/plans/to_description.rs:29-60 | crates/polars-stream/src/physical_plan/to_description.rs:36-65 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5448656283665913e257bbaab5d24205e3dd4f4d7b8da2755df7032dfc03694f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs:194-210 | crates/polars-plan/src/plans/conversion/type_coercion/membership.rs:288-304 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b103552db2b558215684e81c4ecb207038d358585facc0c8ce6097144dfde29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-core/src/chunked_array/ops/fill_null.rs:157-180 | crates/polars-core/src/chunked_array/ops/fill_null.rs:186-213 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/fill_null.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"18da7d0a147fb844a30da049ade919e7c0c63fcb3f68ed25e8b0e0d67d4c54c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:40-60 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:47-73 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2124f5bbcabaf6ffe6d293dc4eda42092fc1843878428ad5c70ec868de562d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 34\u002B corresponding lines): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:360-393 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:397-433 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:441-474 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:478-514 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fc9d108d958f4c1daadb7a4831f796d9ca721fefa6b75909a87c9b1b700b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/polars-expr/src/idx_table/binview.rs:276-326 | crates/polars-expr/src/idx_table/row_encoded.rs:256-294 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18067bbabdd08a165169b062ede595f2f2d0816cc2240b26c8d2548c1e23592"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/polars-plan/src/dsl/function_expr/array.rs:47-77 | crates/polars-plan/src/plans/aexpr/function_expr/array.rs:215-245 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/array.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6d4155088a1844ed38f9c1a38093f3943fbd7a33d17f7403d090bb87933fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:64-94 | crates/polars-stream/src/nodes/io_sources/lines.rs:52-82 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:59-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 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e1fed5b01e8eef180b231083160e551a5752cf6b91ba60e2d2eb880f1368de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-expr/src/dispatch/misc.rs:282-298 | crates/polars-expr/src/dispatch/misc.rs:300-316 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"792bf8e4b9f3f818a479e107cb6043fc9ab20cc888ba2005cac2189ff5cc48b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-expr/src/hash_keys.rs:502-528 | crates/polars-expr/src/hash_keys.rs:543-567 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hash_keys.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c4b3263832a75332b2ab680988e6f4e226e34b9fae91326e1abe4912f8cb8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/polars-compute/src/binview_index_map.rs:181-209 | crates/polars-compute/src/binview_index_map.rs:213-243 | crates/polars-utils/src/idx_map/bytes_idx_map.rs:88-114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e95d2b7839413889fd94328cf10a136b477dfaa52af069c252f060e6ac13f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/polars-compute/src/unique/distinct.rs:350-375 | crates/polars-compute/src/unique/distinct.rs:417-442 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ee7746e4b0bdac6c78f1304e731a0cdc421b826a11a566768ba33324be23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-expr/src/dispatch/misc.rs:1170-1193 | crates/polars-expr/src/dispatch/misc.rs:1199-1221 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7cf9a5f575dd977b59fbee727af256107d05f61d4622cf08682ba23f729942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-ops/src/chunked_array/cov.rs:12-25 | crates/polars-ops/src/chunked_array/cov.rs:33-46 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/cov.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c960e75d3427a43ce25c1c5cfde3b6c58a6cebbe5d433bc90dbd08437644ba05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/polars-ops/src/series/ops/replace.rs:246-285 | crates/polars-ops/src/series/ops/replace.rs:288-318 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/replace.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1c53fc2aafb1bae91acef3caa430a9a09147d64059aaffd1b5f310741a0fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/polars-parquet/src/arrow/write/boolean/basic.rs:61-102 | crates/polars-parquet/src/arrow/write/primitive/basic.rs:154-191 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/boolean/basic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"348968ef1a80d5f15013aa96cfdc121bb8da91baa2040afa35aea48392deec89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-compute/src/rolling/no_nulls/rank.rs:64-84 | crates/polars-compute/src/rolling/nulls/rank.rs:59-83 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/rank.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbebd5fd9d24a1b9910dc4df65083ba2ddb4c0b9011038d0684821388146bd18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-expr/src/reduce/mod.rs:514-532 | crates/polars-expr/src/reduce/mod.rs:762-784 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef83a6cb50be8b641b0ced09e38786609f3af81f17225a37130077e8a41c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/polars-ops/src/chunked_array/strings/strip.rs:55-75 | crates/polars-ops/src/chunked_array/strings/strip.rs:77-97 | crates/polars-ops/src/chunked_array/strings/strip.rs:99-119 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/strip.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0a057a61b5e1bca989ea8adbbcc31addca795cf8f0016d717c028d52593e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-plan/src/utils.rs:338-363 | crates/polars-plan/src/utils.rs:371-395 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/utils.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6c8d537d7f737a42bc2c3e23ec0e7fa09229d3012c5c4b67890183acfdf4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs:3-26 | docs/source/src/rust/user-guide/concepts/streaming.rs:3-36 \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":"docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"154efe9d48f28ef5de3ae408c9987d790f98fe0099f1cbac1600d85322137457"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/polars-core/src/frame/mod.rs:632-661 | crates/polars-core/src/frame/mod.rs:663-693 | crates/polars-core/src/frame/mod.rs:753-776 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1432724a34d2daffbdb70e125b1021a28da4477b58fbda5a06eccbf88924b246"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/polars-io/src/cloud/credential_provider.rs:329-359 | crates/polars-io/src/cloud/credential_provider.rs:362-388 | crates/polars-io/src/cloud/credential_provider.rs:391-419 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"crates/polars-io/src/cloud/credential_provider.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9574d10d11324bf9185c88fe1f8d9309b4515fb6cde886da7923be01dbe306c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/polars-sql/src/subquery_pull_up.rs:1126-1142 | crates/polars-sql/src/subquery_pull_up.rs:1146-1165 | crates/polars-sql/src/subquery_pull_up.rs:1212-1237 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ccd7c4fd75bc745a0cfb6fc38f451439bbae5df91ae3bf85caae0908c64a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:154-169 | crates/polars-core/src/chunked_array/ops/arity.rs:181-196 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5466613507326cc7c57d7db32ffc2e9c07cd82cecadb199cb19c97c7eb30865"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-expr/src/dispatch/boolean.rs:254-273 | crates/polars-expr/src/dispatch/boolean.rs:276-295 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/boolean.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1e36f7879e661876fdf7e5ec3f8781ad156d506c059194150573a3747f3252"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-expr/src/dispatch/datetime.rs:67-88 | crates/polars-expr/src/dispatch/datetime.rs:89-110 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/datetime.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c61d0c758150273720eb283e97454d0a52dbe269b8be4b457be93a63c2aaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-parquet/src/parquet/statistics/mod.rs:44-56 | crates/polars-parquet/src/parquet/statistics/mod.rs:58-70 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/statistics/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7698044b41c6eb182efe570575b1df552d01ffe5d1e076fa02772a1e58619e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): docs/source/src/rust/user-guide/io/csv.rs:1-32 | docs/source/src/rust/user-guide/io/parquet.rs:3-30 \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":"docs/source/src/rust/user-guide/io/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e4e4cfd33c60199b8e4b99aa7ed17b9f6cfc97f52f040581ef80d515685ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): py-polars/src/polars/functions/lazy.py:869-959 | py-polars/src/polars/functions/lazy.py:989-1052 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6f3af1b928f0f1d72a513fc8fbf3d414842e2423236175653d647c3e122be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-io/src/cloud/concurrency/admission.rs:91-139 | crates/polars-io/src/cloud/concurrency/admission.rs:327-361 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/admission.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"008711dd419d7b5874ab1d3b8938168a9df3649c636116ac25516c0403baddb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/polars-ops/src/chunked_array/strings/substring.rs:18-52 | crates/polars-ops/src/chunked_array/strings/substring.rs:70-106 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/substring.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6137879d85cf80b82526b8999a4ecd1e32d32727ba58df7e46be1f46c38939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-python/src/interop/numpy/to_numpy_series.rs:119-135 | crates/polars-python/src/interop/numpy/to_numpy_series.rs:141-159 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/numpy/to_numpy_series.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ede5d4698fa4a7193165d226607607f1afce1373bf712788eb77abae2d58abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-core/src/frame/mod.rs:1829-1853 | crates/polars-core/src/frame/mod.rs:1899-1930 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3dcf4403fae49c6a5ab3229a5b6b4b0b74675958dfe673fae08a4e74d31a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-compute/src/moment.rs:175-193 | crates/polars-compute/src/moment.rs:251-271 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"63870008d4d91df1f3aa7fd85d6d7c11158fabc487cd24d6c865289b25ce991f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/polars-core/src/chunked_array/cast.rs:603-630 | crates/polars-core/src/chunked_array/cast.rs:632-660 | crates/polars-core/src/chunked_array/cast.rs:669-689 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0c9ea70086f810c60065cdef312114fc7fae57dd41dce5510328d49dba7b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:668-693 | crates/polars-core/src/series/arithmetic/fixed_size_list.rs:704-723 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b044e19c3450ccd628a66063cedf3174e2b70ae28e474949895411df6506699a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-core/src/utils/mod.rs:1017-1034 | crates/polars-core/src/utils/mod.rs:1043-1060 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68cc0932abcefba786760795ca539f1fe24648c497d8e9d52b8fd1a12b54152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-expr/src/dispatch/strings.rs:368-388 | crates/polars-expr/src/dispatch/strings.rs:390-410 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7bde1612c186500e1e9bcbb4570474d3f5d5ede4e750e7495f86a8669f5904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-core/src/chunked_array/ops/apply.rs:24-42 | crates/polars-core/src/chunked_array/ops/apply.rs:53-69 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/apply.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d023fddf9d0c54feced83a8b07748d87c157205e3288190536e02d42313e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-expr/src/dispatch/pow.rs:191-212 | crates/polars-expr/src/dispatch/pow.rs:223-244 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/pow.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c1a26c44f6271f60be297b0c9754e5761673d1d521084e1f01b6e9402919b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/polars-ops/src/chunked_array/list/namespace.rs:637-661 | crates/polars-ops/src/chunked_array/list/namespace.rs:674-698 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4f5836fe76f8376a57ef7111ad84cf97ce60c2f584af2d539b906aca2215b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-io/src/utils/compression.rs:90-110 | crates/polars-io/src/utils/compression.rs:266-282 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/compression.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d305243e6296352d4f74fcf8f0eddd34605e7f164435d70624b36db792819c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/polars-lazy/src/frame/mod.rs:1031-1062 | crates/polars-lazy/src/frame/mod.rs:1149-1180 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d99b30a6cc2d685861d696fcaba630e0fe546b970c0e841a3b19751fbe6ece4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/polars-parquet/src/parquet/statistics/boolean.rs:14-44 | crates/polars-parquet/src/parquet/statistics/fixed_len_binary.rs:20-49 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/statistics/boolean.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc51a4a5ff770055822fc7894bb106b346fd66edc143623e45b1bb0d66deb89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-compute/src/gather/binary.rs:30-44 | crates/polars-compute/src/gather/boolean.rs:67-80 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/binary.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae6248716b65d5b9bb82c712d8a3b5749eeda6f982e6612aa4ba2a9c3a620b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/polars-expr/src/reduce/first_last_nonnull.rs:133-156 | crates/polars-expr/src/reduce/first_last_nonnull.rs:213-234 | crates/polars-expr/src/reduce/first_last_nonnull.rs:281-302 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last_nonnull.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92f917fb408d0b9d5c1a6484c0235c58bb45ebcfdad46f9b40bab7929b5bbdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-stream/src/nodes/is_sorted.rs:220-249 | crates/polars-stream/src/nodes/reduce.rs:191-209 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/is_sorted.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b773bdd6b0656cf402306d39352d142afe92a7f4520972b1aa267ce0489320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/polars-ops/src/chunked_array/binary/namespace.rs:116-133 | crates/polars-ops/src/chunked_array/binary/namespace.rs:149-166 | crates/polars-ops/src/chunked_array/binary/namespace.rs:168-185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/namespace.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3877a85b983973ea7f1aafc2ef00431c52879cc1fd757ba4c78cf71db5b74011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:25-41 | crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:62-81 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0db38e94148bd492d2ddc93bc66a9196e8219450c3729872f39e825fad97d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): py-polars/src/polars/io/iceberg/_utils.py:739-764 | py-polars/src/polars/io/iceberg/_utils.py:771-805 \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":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d1fba5638e81d90d6a690e77b6dd6deb31df414a5ed88f69d89be45ecad0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-expr/src/reduce/first_last_nonnull.rs:18-42 | crates/polars-expr/src/reduce/implode.rs:16-34 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last_nonnull.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3fba6e5792972c1c7c219f911e686e1407306b48d73e813b24c5b0bd0bddc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-lazy/src/frame/mod.rs:1077-1100 | crates/polars-lazy/src/frame/mod.rs:1123-1146 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab379c14dcff5025e8ed6a8ac5634f779e0f2b80f0329454f4a8f8209861d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-ops/src/series/ops/rolling.rs:19-41 | crates/polars-ops/src/series/ops/rolling.rs:83-111 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rolling.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a794e2306165b9e149f5ce8a66884177276a5698ef8925560c501b69bbdfe434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): py-polars/src/polars/dataframe/group_by.py:170-221 | py-polars/src/polars/dataframe/group_by.py:955-980 | py-polars/src/polars/dataframe/group_by.py:1156-1183 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/group_by.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee69b61daadc353868063327b73ba4cacd4ec688b03471e9d730edd11198c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): crates/polars-core/src/chunked_array/mod.rs:283-315 | crates/polars-core/src/chunked_array/mod.rs:318-350 | crates/polars-core/src/chunked_array/mod.rs:353-385 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fde887c85954cf4e3010185df6f8cd056d98ead73f6efe0edc5ef7fa0cc21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-sql/src/context.rs:2585-2601 | crates/polars-sql/src/context.rs:2604-2621 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"185661d232ccec9a15a1dbd1dc1df00d42f91d081aa13b18c8a3e441273e1c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-compute/src/comparisons/array.rs:94-113 | crates/polars-compute/src/comparisons/array.rs:115-134 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/array.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38262f772a1810c29d9c46b2164d62d6410d449e217aad3573f038644ae76c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/polars-expr/src/dispatch/datetime.rs:266-283 | crates/polars-expr/src/dispatch/datetime.rs:293-307 | crates/polars-expr/src/dispatch/datetime.rs:310-324 | crates/polars-expr/src/dispatch/datetime.rs:359-384 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/datetime.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f46cdd59e21b2dc82d2d9209523f6cbbdf7c4411029d8c801617821e920ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-plan/src/plans/parquet_footers.rs:217-238 | crates/polars-plan/src/plans/parquet_footers.rs:245-265 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/parquet_footers.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bcc9eabefc52d9ff07fd5d2f06339114bad9756dc94b6911b18f0318fdfca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-compute/src/rolling/no_nulls/rank.rs:38-62 | crates/polars-compute/src/rolling/nulls/rank.rs:35-57 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/rank.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b2ec3c969105cc16efbca4080634242952936bf1533ef5fe1544460cab9b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/polars-expr/src/reduce/mean.rs:9-27 | crates/polars-expr/src/reduce/skew_kurtosis.rs:9-38 | crates/polars-expr/src/reduce/skew_kurtosis.rs:44-75 | crates/polars-expr/src/reduce/var_std.rs:13-47 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mean.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c9419289def3fa66891d5ea79e0455911a92ea90747f8970d4c0566a53ae2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): crates/polars-stream/src/nodes/dynamic_group_by.rs:284-308 | crates/polars-stream/src/nodes/peak_minmax.rs:56-76 | crates/polars-stream/src/nodes/rolling_group_by.rs:225-249 | crates/polars-stream/src/nodes/sorted_group_by.rs:119-142 \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":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7385727eead69043978cbc6c5bbaf99790c31e5d625e119f36a26f9947fb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-expr/src/expressions/apply.rs:90-110 | crates/polars-expr/src/expressions/structeval.rs:193-213 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8150232f6ae014ce41fcac0574e94e3e1cdd69f9b59be2f12da96e573cd3b65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/polars-expr/src/hash_keys.rs:422-448 | crates/polars-expr/src/hash_keys.rs:462-493 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hash_keys.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"460bf5fc8618d9e8bab8898bc6292c89bae2baae92ae560316cf5f66fb0be7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-plan/src/dsl/function_expr/struct_.rs:19-33 | crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs:131-144 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/struct_.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b1b06de8c4f2359467ef1c0762587d07f7c2a57538358f9537715090394adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-utils/src/order_statistic_tree.rs:255-268 | crates/polars-utils/src/order_statistic_tree.rs:271-284 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee956dd1bd37ffd4188696932e6d9be69ed9235543f88f6e84571053afb6619f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-compute/src/float_sum.rs:198-216 | crates/polars-compute/src/float_sum.rs:224-241 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/float_sum.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"24444641692643e95e865bbc11ae584efccbdecdb8d7c815db67b23877392253"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 25\u002B corresponding lines): crates/polars-core/src/chunked_array/comparison/mod.rs:24-48 | crates/polars-core/src/chunked_array/comparison/mod.rs:50-74 | crates/polars-core/src/chunked_array/comparison/mod.rs:76-100 | crates/polars-core/src/chunked_array/comparison/mod.rs:102-126 | crates/polars-core/src/chunked_array/comparison/mod.rs:136-160 | crates/polars-core/src/chunked_array/comparison/mod.rs:162-186 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b94fd0546644b47bae38752695bea52d2b0d614fedc5f9a54cc5d3d2b2f23dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/polars-io/src/csv/read/builder.rs:139-164 | crates/polars-io/src/csv/read/builder.rs:406-432 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acd9b6bebdfd129a0731925cdad504036c16abe2fa5c2a69ce7cfd1b238efa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs:57-80 | crates/polars-stream/src/nodes/io_sinks/writers/parquet/mod.rs:99-122 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"545cd235d8be52262790f09eac717cec08fa868c7f3e3dc28acfab8ace32278e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/polars-compute/src/rolling/moment.rs:323-352 | crates/polars-compute/src/rolling/sum.rs:184-213 | crates/polars-compute/src/rolling/window.rs:148-177 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/moment.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd1636214941754f139ca348a52a499a0421009ae1f176cc433b3ffc634ad2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:771-783 | crates/polars-core/src/chunked_array/ops/arity.rs:796-808 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2bf66c2acd4a607ee851166e227b902de3aa8d0579d27da4b9df635fb58796"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs:11-29 | crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs:31-50 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92b0739e49b515ae444b7a00e5f88d5b8428dde509768d7023a227c442f563f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-time/src/series/mod.rs:151-162 | crates/polars-time/src/series/mod.rs:165-176 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/series/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f87e60bef06a8daa4c311a0e1af0506bebb88d11c95f90c56d459fb1e0f3dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-expr/src/idx_table/key_rows.rs:134-149 | crates/polars-expr/src/idx_table/row_encoded.rs:92-107 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/key_rows.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac41aedca91b7eb2ef8b3d3fe57d0462e808e20e767332cc57394bb93379966"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:578-595 | crates/polars-core/src/chunked_array/ops/arity.rs:664-680 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5b4ed0028505df0f0e856a25113e2b53e66dd0c001e33f2ab3888dcd4c3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-core/src/chunked_array/random.rs:83-104 | crates/polars-core/src/chunked_array/random.rs:140-158 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/random.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe54016009eec8b7e070fe602e7b3c5fa51a180c68617652f0aeb35974782015"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-io/src/ipc/ipc_stream.rs:267-288 | crates/polars-io/src/ipc/write.rs:157-183 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ipc/ipc_stream.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"49df8f9f00880dd2b48e8a003196697332b47dd3a896800a6c4d7a621ce4c797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-compute/src/moment.rs:349-366 | crates/polars-compute/src/moment.rs:492-515 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1043f9a1cd38cd50b7b98cf8e05b07da0038ffefb3c654904e725e5a303bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-compute/src/rolling/nulls/mean.rs:23-46 | crates/polars-compute/src/rolling/nulls/sum.rs:22-45 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/nulls/mean.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bccced9917c915d259e9cc2dfb0f82ecaba95ab3b790e863c85a805dc838a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/polars-core/src/series/any_value.rs:256-274 | crates/polars-core/src/series/any_value.rs:276-295 | crates/polars-core/src/series/any_value.rs:296-316 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b5e319268d2a5466fa7982730d76a22fbc835dd22af1ee5cad8f43105ca697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs:173-190 | crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs:229-249 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ca41e9f36bae67474a18b3c236aebf11f13f30b45e26cdb624f0dd3f1e2449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): py-polars/src/polars/dataframe/frame.py:1016-1045 | py-polars/src/polars/series/series.py:1482-1521 \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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4f09e6bf04a108ab47b94aa12c660f545492e82debb36e75f9832779b9f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-core/src/datatypes/any_value.rs:682-697 | crates/polars-core/src/datatypes/any_value.rs:1164-1178 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c01aa88306979b862e0da689d662f35a13fd8ede32683584e09ec225cc2407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-ops/src/chunked_array/strings/extract.rs:99-117 | crates/polars-ops/src/chunked_array/strings/extract.rs:123-143 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/extract.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"80784be7791c5b6ba093b19b5be74ef8894982d8eefe0db1ee3befeba4371c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/polars-plan/src/dsl/function_expr/rolling.rs:29-57 | crates/polars-plan/src/plans/aexpr/function_expr/rolling.rs:28-56 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/rolling.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"119f4d8fb24050dc531242ebea5041574afefd6530de74e89987d070a25343fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1201-1214 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1216-1229 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102ab94e40e09f45b97756be22515057cfb0ea33cc6ae9e41f7454f2a11dd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-core/src/chunked_array/ops/chunkops.rs:200-218 | crates/polars-core/src/series/series_trait.rs:323-341 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/chunkops.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2619285a117270b497e68dcc0c998add73b90bbff9a83004cdfcc8d926d19229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:167-186 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:231-258 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef2ee4b7cdd6c6c3cf3cdc1d10ee466f0cc5f92ab0282ca92759b37eb1a8c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-expr/src/dispatch/array.rs:144-157 | crates/polars-expr/src/dispatch/list.rs:78-91 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/array.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee973ae19055602d307c390af3177f8de8c4974c2625b984f3689bfcc216dd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-expr/src/dispatch/trigonometry.rs:10-32 | crates/polars-expr/src/dispatch/trigonometry.rs:52-73 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/trigonometry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50cd02ad6e245660ed4a9dfd3879dff8e1eaa65c8493e736bdbc57cd366c084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-expr/src/reduce/any_all.rs:325-339 | crates/polars-expr/src/reduce/any_all.rs:451-465 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c30efc9076511162068e4c491a9e2ac6eb1aa2100213e82bdfc35c9c6ace9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-core/src/frame/horizontal.rs:20-38 | crates/polars-core/src/frame/horizontal.rs:54-70 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/horizontal.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"64753861f6fb1b0b69264373fbd2b561e96850c959a62a10eaa1f30f86e4104a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-expr/src/reduce/cov.rs:80-90 | crates/polars-expr/src/reduce/cov.rs:224-234 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ec9e396d436769eb2955df2894cb560f70b4f51b2c5cf8dde7759d54f757e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/polars-core/src/chunked_array/comparison/scalar.rs:86-95 | crates/polars-core/src/chunked_array/comparison/scalar.rs:108-117 | crates/polars-core/src/chunked_array/comparison/scalar.rs:139-148 | crates/polars-core/src/chunked_array/comparison/scalar.rs:150-159 | crates/polars-core/src/chunked_array/comparison/scalar.rs:161-170 | crates/polars-core/src/chunked_array/comparison/scalar.rs:172-181 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/scalar.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a359b32ca53e1709b9bcb50879e8ab29895056b66038d4d19644d6fe30968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/polars-core/src/series/any_value.rs:318-336 | crates/polars-core/src/series/any_value.rs:509-527 | crates/polars-core/src/series/any_value.rs:530-548 | crates/polars-core/src/series/any_value.rs:584-603 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"41688e59ced08102ce3c263bddc24fdba99f712635cc0a2ed1f9eee587dfd8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 21\u002B corresponding lines): crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:36-56 | crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:62-87 | crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:99-125 | crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:132-158 | crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:165-191 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e708ec853edefca0e4291e37ebfea510ffa610f107f3212e6a91646c1392506a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-io/src/csv/write/writer.rs:46-66 | crates/polars-io/src/csv/write/writer.rs:201-228 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/writer.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24be3f80383c4b8b7032f055c4fc3b8d308226464e582c8f30b914517c9e885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-plan/src/plans/aexpr/predicates/mod.rs:49-60 | crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs:167-178 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c0b517cffc2bfdad84d9fcbf35f266e9738591564368362196e32f8fe84dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): py-polars/src/polars/io/delta/_sink.py:958-989 | py-polars/src/polars/io/iceberg/_sink.py:1623-1657 \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":"py-polars/src/polars/io/delta/_sink.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"987785e9c14fcb22879ee298e82d3c2700b419f5eabb4e38980266bfc8afcab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-plan/src/dsl/function_expr/cat.rs:22-39 | crates/polars-plan/src/plans/aexpr/function_expr/cat.rs:45-62 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/cat.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4daf103b10817128a37dd2d080d204d510cf7f4bbcc36bd23f8a60d46b8d98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-core/src/series/arrow_export/categorical.rs:281-302 | crates/polars-dtype/src/categorical/mapping.rs:154-174 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/categorical.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b92198fc19e71b0e1d2baaef89dbf6790b61488b9e907cafbbd5974b7c0df3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-ops/src/series/ops/is_first_distinct.rs:76-89 | crates/polars-ops/src/series/ops/is_last_distinct.rs:145-159 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1f28e7de7428e9e8873597be68a7de22433e5e4491de968d682d9314caeb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/polars-plan/src/dsl/mod.rs:489-504 | crates/polars-plan/src/dsl/mod.rs:515-529 | crates/polars-plan/src/dsl/mod.rs:540-554 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/mod.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d792b0af793d884664682dc5b4996420c325ef1b342b2120b961378bd69841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-python/src/interop/numpy/to_numpy_df.rs:248-272 | crates/polars-python/src/interop/numpy/to_numpy_df.rs:274-294 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/numpy/to_numpy_df.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102742690bb1d0bfe49d8547e1fff7f4ee8c97779dc8fecbedd72e4ef4742b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/polars-core/src/chunked_array/ops/apply.rs:74-92 | crates/polars-core/src/chunked_array/ops/apply.rs:97-117 | crates/polars-ops/src/chunked_array/binary/namespace.rs:48-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/apply.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f6eeee78d81cbe58ab1fcc0bf6f5ce7ae8b4ad31ad25581352519864a855c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 16\u002B corresponding lines): crates/polars-core/src/datatypes/dtype.rs:795-810 | crates/polars-core/src/datatypes/dtype.rs:812-830 | crates/polars-core/src/datatypes/dtype.rs:832-848 | crates/polars-core/src/datatypes/dtype.rs:850-866 | crates/polars-core/src/datatypes/dtype.rs:884-902 | crates/polars-core/src/datatypes/dtype.rs:904-919 | crates/polars-core/src/datatypes/dtype.rs:921-942 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb00d9a3947c368d1a0674ec8134a1e6a690376bc7a01f093456c52efcc79959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-sql/src/catalog.rs:808-827 | crates/polars-sql/src/catalog.rs:1058-1073 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70b45bb909060afb7dae3a443dd227cd4a66e775e535663e367223db4330329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-compute/src/comparisons/mod.rs:16-24 | crates/polars-compute/src/comparisons/mod.rs:26-34 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7949735b0b45d86395eb1edc412f36cc0773ae0ab39b01cd9ec19c28a6b7366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-sql/src/functions.rs:3071-3083 | crates/polars-sql/src/functions.rs:3086-3098 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"160fab94edcf47ae98d830c74de60eef137ee9c7de1f3426e69e40cd5f54547b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-ops/src/series/ops/horizontal.rs:56-66 | crates/polars-ops/src/series/ops/horizontal.rs:72-82 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/horizontal.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"94428e768ed400a924be9237ea1f20272b1c59fff574f61c954f136dd1846c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-core/src/chunked_array/ops/aggregate/mod.rs:140-161 | crates/polars-core/src/chunked_array/ops/aggregate/mod.rs:163-193 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/aggregate/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1739e6dd03c794b900a6cd8b60b15e3e82896f364868a3c2ed37e8676ef24587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-expr/src/dispatch/range/datetime_range.rs:23-37 | crates/polars-expr/src/dispatch/range/datetime_range.rs:45-59 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/datetime_range.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"219b483623238d60136d8f7db8eef65c1ce7f390826b218e6f162aafa0272029"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-compute/src/moment.rs:298-320 | crates/polars-compute/src/moment.rs:436-462 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"df25fd888815fe5c4e8a2d8d746f3f97fca4eed2029091993b1a8813f9f6a8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-core/src/chunked_array/ops/chunkops.rs:142-161 | crates/polars-core/src/series/implementations/null.rs:61-74 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/chunkops.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f54c61c2e3546a8c747189a074cf61bb39d5f3ade607c85d274368db5a267b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-core/src/datatypes/dtype.rs:332-344 | crates/polars-core/src/datatypes/dtype.rs:1434-1449 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"85edee00dd014ee8e661a5fc95bf510e5f34cba6409842d5daa305c943e4c76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-io/src/utils/other.rs:97-119 | crates/polars-io/src/utils/other.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":"crates/polars-io/src/utils/other.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8d361823cb483ef70596aabd2e9e374fa9616414302a1c2f84b5bd56d0ba46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-ops/src/series/ops/is_in/binary.rs:134-150 | crates/polars-ops/src/series/ops/is_in/binary.rs:186-198 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/binary.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"661ee3d453695002766fbc1be59217417fe2b0f3a3ef905c2e212d5bee00ff41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-plan/src/plans/lit.rs:31-38 | crates/polars-plan/src/plans/lit.rs:54-64 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/lit.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a007bcc588a8f5bc4c39395cb5bb308a0c22de52f27a03d845df2c4cb6934b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-plan/src/plans/options.rs:760-782 | crates/polars-plan/src/plans/options.rs:785-808 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3ffd69e6c5989d72281c1bfc531aa74649c6ff707f4e3f7f6c1fef95785864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-utils/src/arc.rs:4-19 | crates/polars-utils/src/arc.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":"crates/polars-utils/src/arc.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf955f0395fb10078f7573c0b9463390f15a63234e73a7f86d7ba2b56f93cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): py-polars/src/polars/series/string.py:98-188 | py-polars/src/polars/series/string.py:235-346 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/string.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5c947df03190deb023f1782185c5377e52577bfa86d7661df9abb638eeffba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-ops/src/chunked_array/gather/chunked.rs:445-456 | crates/polars-ops/src/chunked_array/gather/chunked.rs:463-478 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b4afab6a9918749f968fff5f7db00b5374e14f1c8293a747a67141085b159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-python/src/sql.rs:399-410 | crates/polars-python/src/sql.rs:419-429 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d1d366a6c26297ba15fd1dc38edf3d488dcf17590eaf88d18831287fc462f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/reduce/mod.rs:407-418 | crates/polars-expr/src/reduce/mod.rs:669-682 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ede371ac5bee0cea2bd8e701caa2d1a7207c2e8b2f0e6ddb69958e40098f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-json/src/json/deserialize.rs:26-38 | crates/polars-json/src/json/deserialize.rs:105-118 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54bd91f36c87015b8000ee322c334831e0832040c1db35188e7de4461278ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:34-51 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:53-70 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:208-225 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:229-246 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc27d6795f19fb0a80a2d677f0ee3f0b6fbc2467cec15823f86e4425c1baca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-python/src/map/series.rs:42-57 | crates/polars-python/src/series/map.rs:82-101 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/map/series.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"35468797184535e8320198948fb8aba813a3b48a7907de76dc047140e4792d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): py-polars/src/polars/dataframe/frame.py:519-575 | py-polars/src/polars/expr/expr.py:574-627 | py-polars/src/polars/lazyframe/frame.py:500-560 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"628a456f974d458f484fd15c7c887b00a9279bcd4605e8ad0295a3129a2e8b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): py-polars/src/polars/io/spreadsheet/functions.py:273-435 | py-polars/src/polars/io/spreadsheet/functions.py:554-648 \u2014 These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"144d4aa7df42153994bbdd564f3720847835e15c749a42c92592eec86e9df5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/polars-python/src/catalog/unity.rs:61-82 | crates/polars-python/src/catalog/unity.rs:85-109 | crates/polars-python/src/catalog/unity.rs:117-142 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/catalog/unity.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"db10f5866b0950df9c7e0b779d14a9ec5970deecdc852b76dccf15d8051a8d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/polars-python/src/series/construction.rs:150-167 | crates/polars-python/src/series/construction.rs:179-196 | crates/polars-python/src/series/construction.rs:296-313 | crates/polars-python/src/series/construction.rs:316-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 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/construction.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc015179fe4db5e5ef2a0fb9caf5710a3c53af434c14b915056933daec8904f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/polars-buffer/src/storage.rs:157-172 | crates/polars-buffer/src/storage.rs:216-231 | crates/polars-buffer/src/storage.rs:233-250 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/storage.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae88db319975c1a181f18b2a98d35c1299ce8b5777e4b87554cbfd4fd1d414"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:257-270 | crates/polars-core/src/chunked_array/ops/arity.rs:334-347 | crates/polars-core/src/chunked_array/ops/arity.rs:700-715 | crates/polars-core/src/chunked_array/ops/arity.rs:741-756 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ccf76eb6c618b8cf2c2e3e40a5e7b8a837c1977e3a3761ba05beebfd046fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/polars-expr/src/dispatch/strings.rs:295-305 | crates/polars-expr/src/dispatch/strings.rs:308-318 | crates/polars-expr/src/dispatch/strings.rs:321-331 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aceb535c49da166188bcc94818470b06f1f1a2ccaf0fd34d5e2e6f2c93b379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs:161-173 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs:180-192 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34409a60ff41bcf20870b55a1609cadf7f4301ba421d7258a9527a8aeeb8b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-core/src/series/mod.rs:1005-1028 | crates/polars-core/src/series/mod.rs:1031-1053 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9842faf52a3a772fb400aaf7a3ce0740284dc0fbb9fffd04a99c5bdee3ca01ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-expr/src/expressions/apply.rs:234-248 | crates/polars-expr/src/expressions/structeval.rs:54-68 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d4a052e790aff28864f99f201c95a3d22f7e81df4999e296920ebfd9a209c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-ops/src/chunked_array/array/join.rs:93-104 | crates/polars-ops/src/chunked_array/list/namespace.rs:60-72 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/join.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1993b4d0946db4226e6c46a2c374b0768a48e4e2e213ca6d89f3b608d25048e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-ops/src/chunked_array/strings/strip.rs:5-17 | crates/polars-ops/src/chunked_array/strings/strip.rs:19-31 | crates/polars-ops/src/chunked_array/strings/strip.rs:33-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/strip.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a56d21022458c3d93f23d61d4bef14a5ef84c5e6341170a6463a2abe7408a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-python/src/io/parquet_encryption.rs:27-44 | crates/polars-python/src/io/parquet_encryption.rs:66-83 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/io/parquet_encryption.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"de079fdb28ac5d0a6d059939f66dfbc2f86f748e54ab80b06e864e135c6cfb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-io/src/catalog/unity/client.rs:121-144 | crates/polars-io/src/catalog/unity/client.rs:168-193 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/catalog/unity/client.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd88969840deb5023da7382eea6e79115a208f62531a13847e8f5b1dcdec8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/polars-plan/src/dsl/functions/range.rs:43-66 | crates/polars-plan/src/dsl/functions/range.rs:76-99 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/range.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e5617a8e99892bf292b27e9103ed76f368037a60641261078e301b7cf6b83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-time/src/series/mod.rs:180-189 | crates/polars-time/src/series/mod.rs:204-213 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/series/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2fb431c51c653f09d67b4148eb83e74659c06ab520b292cac23c2e11ef4a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (172 corresponding lines): py-polars/src/polars/lazyframe/frame.py:3308-3487 | py-polars/src/polars/lazyframe/frame.py:3918-4089 \u2014 These two members are one piece of code written twice and then edited apart: 172 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"945d9853189701df11297b807cb24d9239cd7601c8c9285190d3cea5fc1ebcae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-core/src/series/builder.rs:80-100 | crates/polars-core/src/series/builder.rs:132-157 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/builder.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6610244e62cbdc0e83bb91c6244f55a69fc73d9451373eb7921df9ac7ddb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-lazy/src/frame/mod.rs:2073-2088 | crates/polars-lazy/src/frame/mod.rs:2091-2106 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc39b6d8b2621b48548b956014ff69621d591d2e7888a9b8a3534eff7fb97a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:215-229 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:593-609 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79f7e34cd70d2e685b4071baf78108b3504bec5f2ed23ee3440ad8f1e7a8331"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/polars-time/src/series/mod.rs:24-33 | crates/polars-time/src/series/mod.rs:37-46 | crates/polars-time/src/series/mod.rs:50-59 | crates/polars-time/src/series/mod.rs:63-72 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/series/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3f7404b4db98a9693fa809bb96f05f8f561073011cf408a4a64b377061c6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-expr/src/dispatch/pow.rs:174-189 | crates/polars-expr/src/dispatch/trigonometry.rs:34-50 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/pow.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5ba5398e133823f53639bd0ecb9137bbd4b7f3f20bf3fabcbf24187ac33d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:762-774 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:778-790 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cc6e895fe96d80b7916ce8fa4ff8d15e3acc23de1c33ccfc335415ebf2dfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-python/src/series/aggregation.rs:66-77 | crates/polars-python/src/series/aggregation.rs:79-90 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/aggregation.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed110b8e875b852250f5eb063994c29b2e89cfd922404606f4f9bd5b1c0a7e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): py-polars/src/polars/io/ipc/functions.py:412-504 | py-polars/src/polars/io/lines.py:151-241 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/ipc/functions.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f1422098a7bdf2f2791eeee9bc546adf91f7b65c471e193fffb7dfa02a0d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-ops/src/chunked_array/strings/escape_regex.rs:8-21 | crates/polars-ops/src/chunked_array/strings/normalize.rs:8-21 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/escape_regex.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7e6af006df72ac290c96d7941f34861235c6cbdc15fd9d32a02b2b01df223a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-python/src/lazyframe/general.rs:385-398 | crates/polars-python/src/lazyframe/general.rs:407-420 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727e7d807504d88230d84e7a60ceffffef6791a11c196e3055af4f24ba65f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-python/src/lazyframe/general.rs:857-877 | crates/polars-python/src/lazyframe/general.rs:963-982 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"716acf4b9cc4865f90415f7c9260a9d92e885f120f88e9fadedaf48d41253423"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-core/src/chunked_array/ops/fill_null.rs:302-323 | crates/polars-core/src/chunked_array/ops/fill_null.rs:325-351 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/fill_null.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd495dc06d58bd144d8eb2748533a1602320d89440f7ac102811263bb8395d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-io/src/csv/read/parser.rs:447-468 | crates/polars-io/src/csv/read/parser.rs:692-709 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"075b3ba10ec32f56b6db4b9dfb97221dfefded1ce8c86726385d78d980ec8983"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-ops/src/chunked_array/repeat_by.rs:31-47 | crates/polars-ops/src/chunked_array/repeat_by.rs:49-61 | crates/polars-ops/src/chunked_array/repeat_by.rs:63-75 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/repeat_by.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"05536099ffcd097dc6ac40ee53774cee6f88d1cd4cccfdc37140aa791d49d9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-parquet/src/parquet/write/file.rs:319-337 | crates/polars-parquet/src/parquet/write/stream.rs:114-132 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/file.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6823cd491bd6b9cb19a5e9742b8ecc9ec597b52cddc51e797d79aebd88ddb647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-python/src/functions/lazy.rs:357-379 | crates/polars-python/src/functions/lazy.rs:386-406 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/lazy.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ab169b5053e1979fffc504c9215083f204b9eb35b68b78d7687a443bf1c00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-schema/src/schema.rs:494-510 | crates/polars-schema/src/schema.rs:538-558 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-schema/src/schema.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae086ef51f166ff69b820751889f9595d4d14d26f75e5f24abfa67a9737fb3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/polars-sql/src/context.rs:8239-8261 | crates/polars-sql/src/context.rs:8289-8315 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":8239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f778dc259b893efe53439f836b06461d873fddfb403db16ec26b30b866ca686"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-sql/src/functions.rs:2697-2711 | crates/polars-sql/src/functions.rs:2766-2782 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a311953634133973258f2520438a21e8aa9c1c826890ff105dba62834520c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-stream/src/nodes/rle.rs:54-72 | crates/polars-stream/src/nodes/rolling_fixed_window.rs:150-168 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/rle.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff328cc73315ac65ed29c768984587246430c0e4a4cba99ad43eeef571d4ff2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): py-polars/src/polars/series/series.py:1210-1222 | py-polars/src/polars/series/series.py:1284-1291 \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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4555bd76ce0f6189cd134466f09701ad15dfec548dd02cc953742e74dcf48110"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/reduce/first_last.rs:476-487 | crates/polars-expr/src/reduce/first_last_nonnull.rs:468-479 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c1545e70ba9b544371950482634a1808525c42c0d59ebbaf18a8463e3f8a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-python/src/expr/mod.rs:48-63 | crates/polars-utils/src/python_thread_pool.rs:23-45 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e56b5b9c72a1286f4bdb5b696ba78e40cef78c0d158e68339fd00b58ca28a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-stream/src/nodes/sort/flush.rs:197-215 | crates/polars-stream/src/nodes/window/flush.rs:176-200 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/flush.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3061b4362a5ffe65641ee3becb83ab4cd80e21dbf11622d31f0ccc3fb681cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-utils/src/order_statistic_tree.rs:332-339 | crates/polars-utils/src/order_statistic_tree.rs:370-377 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4b5e6a93f446b42a1d180b1fa38ace48ed7f92c513fda87a4ab30d34619981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-compute/src/rolling/arg_min_max.rs:71-87 | crates/polars-compute/src/rolling/arg_min_max.rs:132-149 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/arg_min_max.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b406400d3e62f8bf8a749a9f256ee0135449876d8303332c389eb98fc906ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-ops/src/chunked_array/array/count.rs:20-28 | crates/polars-ops/src/chunked_array/list/count.rs:54-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":"crates/polars-ops/src/chunked_array/array/count.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b0e04beaa81acd4dbdde9208fdb748da670fd5bcc9a2072aa7199c06afa5c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/plans/ir/dot.rs:452-464 | crates/polars-plan/src/plans/ir/dot.rs:468-480 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dee755b81d9128ed8b864fc31cad510f7be1af3a32b39ecdbbbd655302aed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-compute/src/gather/sublist/fixed_size_list.rs:49-62 | crates/polars-compute/src/gather/sublist/fixed_size_list.rs:68-81 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/sublist/fixed_size_list.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d8b08fb78e886c16be28ec576e4c95f2280ea2432502791fdca2fff383e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-core/src/series/series_trait.rs:609-621 | crates/polars-core/src/series/series_trait.rs:641-655 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/series_trait.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"51751e94e10673c583ee905b376115dfb941279954a59ef2e2448f057d8319b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-json/src/json/write/serialize.rs:125-139 | crates/polars-json/src/json/write/serialize.rs:145-159 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f2fce2c951f4b14c56a2ba682e80d84bc4d60bdb021072cae206d6af3d8f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-ops/src/chunked_array/strings/strip.rs:121-131 | crates/polars-ops/src/chunked_array/strings/strip.rs:133-143 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/strip.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"31900417e5f675c30d3bb2c6647bab5d4324782861403de7a56194f08a671ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): py-polars/src/polars/dataframe/group_by.py:1013-1040 | py-polars/src/polars/dataframe/group_by.py:1220-1251 \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":"py-polars/src/polars/dataframe/group_by.py"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"388bef1e8aa1ac97dbd3ef5e834e426303fbac56d1c4d4891d0ca5f3ae17f34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): py-polars/src/polars/lazyframe/engine_remote.py:259-280 | py-polars/src/polars/lazyframe/engine_remote.py:348-378 \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":"py-polars/src/polars/lazyframe/engine_remote.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"609bcff738a32ffab9ed8f3cd26c6f91b212026c4f85dace338393ac32a3f69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): py-polars/src/polars/selectors.py:1017-1092 | py-polars/src/polars/selectors.py:1200-1289 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"42edac55a4c8f6d025a96e076b3304331cbc2813b1f6c4f438921d2f8e9b3450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-compute/src/moment.rs:162-173 | crates/polars-compute/src/moment.rs:236-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":"crates/polars-compute/src/moment.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"013aa7930f56c21b54a89345dd6478318594c9f6a0f23f3fb896298784d9c655"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-expr/src/key_rows/keys.rs:496-513 | crates/polars-expr/src/key_rows/keys.rs:527-543 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/key_rows/keys.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77f1cc90e01a52511b3310fdba487469cd318285ae318264bbad842c5be0948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/polars-plan/src/dsl/scan_sources.rs:441-461 | crates/polars-plan/src/dsl/scan_sources.rs:475-486 | crates/polars-plan/src/dsl/scan_sources.rs:506-522 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/scan_sources.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d91629a47b69d5dad87b569f9ef0072678560c87d8ba86e4e8a5a3196f4830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/plans/functions/mod.rs:244-257 | crates/polars-plan/src/plans/functions/mod.rs:264-276 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea872c63d05b38ca9ed01ea5dd8d2a00c38bdd4a3cb42f91967349df3a2e4c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/polars-core/src/series/arithmetic/borrowed.rs:208-225 | crates/polars-core/src/series/arithmetic/borrowed.rs:229-246 | crates/polars-core/src/series/arithmetic/borrowed.rs:250-267 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f07f75fe58a7ac57a361be38326e681b25add7612680ac35dd3cafd90beea5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-expr/src/groups/single_key.rs:210-225 | crates/polars-expr/src/idx_table/single_key.rs:310-329 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/single_key.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a547292a527de9b216d33c69b66d7a0373762e0f1f37a04d42a8683e227bbd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-utils/src/parma/raw/mod.rs:296-309 | crates/polars-utils/src/parma/raw/mod.rs:312-328 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced83938445b5f6a3759fe11fc2d89065218d6e41ad29ad1553cb5e263253698"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-compute/src/rolling/moment.rs:270-287 | crates/polars-compute/src/rolling/sum.rs:132-149 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/moment.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc39b9b23317b0c62b0e8cb298b26e07daf03b75d7d70a3036f32ed2582d1de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-compute/src/rolling/sum.rs:68-81 | crates/polars-compute/src/rolling/sum.rs:83-96 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/sum.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4a2730a4b00e9c3f2aacffbac06c345ba3ecf3b7426c31896d8d9f92d060bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/plans/options.rs:584-596 | crates/polars-plan/src/plans/options.rs:633-645 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6ea8b355aa8fd7850be6b16c8c36c7287d660cab37c0119d67b1568a165d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-expr/src/dispatch/datetime.rs:327-341 | crates/polars-expr/src/dispatch/datetime.rs:343-357 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/datetime.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728e6fc677505621fe2397c66a4da17e3cf11bd886587f9c7a932129ec41a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-io/src/cloud/polars_object_store.rs:700-713 | crates/polars-io/src/cloud/polars_object_store.rs:784-796 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/polars_object_store.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54596a67d87fe944290f2c3796c5465351db2fdf5483961fb44f7dacaa2b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/polars-ops/src/series/ops/fused.rs:34-42 | crates/polars-ops/src/series/ops/fused.rs:85-93 | crates/polars-ops/src/series/ops/fused.rs:135-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/fused.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"673805ba2dbe3bfd5d82ea6fc9312a63542ea24280edf61cd497e6e87a269599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:346-356 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:580-595 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/boolean.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e75533fac93f22c0cf368319270a92b03f78205b3ba6d49d4057a29493bc8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/polars-stream/src/morsel.rs:184-203 | crates/polars-stream/src/morsel.rs:208-227 | crates/polars-stream/src/morsel.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 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/morsel.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e78b3d03b085af9a1fed4e327a50b025de3a68b755990d309d55b7cf2e34ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:442-454 | crates/polars-core/src/chunked_array/ops/zip.rs:50-61 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f499ff0e36e4a3fd67c32d7dfab0210774c621da3335b22e4b4c32290c31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-expr/src/key_rows/keys.rs:470-482 | crates/polars-expr/src/key_rows/keys.rs:556-569 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/key_rows/keys.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb5f5541e770d8af445e3a1acea488e08e39234684d93d79c2b25637c29eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/polars-python/src/functions/range.rs:71-85 | crates/polars-python/src/functions/range.rs:93-107 | crates/polars-python/src/functions/range.rs:118-136 | crates/polars-python/src/functions/range.rs:147-165 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"65659de7db1206f17e6e1c104788127eaabcbf0fa7d460c5fd2a3dd1690b094d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-utils/src/itertools/mod.rs:72-88 | crates/polars-utils/src/itertools/mod.rs:96-109 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/itertools/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfee5e1d3eaafe2832edfc25fa5fe172f17dee38cde128871a60007f9cd09a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): py-polars/src/polars/dataframe/group_by.py:1047-1088 | py-polars/src/polars/dataframe/group_by.py:1258-1302 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/group_by.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d636fd3eb709f281e904927cdce325f6fba936ad7b95bf941e767888a91251"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-compute/src/cast/decimal_to.rs:60-71 | crates/polars-compute/src/cast/decimal_to.rs:88-99 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/decimal_to.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a23db32ee365f12d340a2b86836b9bfbdd491d76ce62be17c3f56813fef4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-compute/src/moment.rs:632-644 | crates/polars-compute/src/moment.rs:695-707 | crates/polars-compute/src/moment.rs:712-724 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b76b0f194201cb512103e3094311e32da8c64c11e4f18d2ff2b38d8496eb119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-compute/src/rolling/no_nulls/mod.rs:142-154 | crates/polars-compute/src/rolling/no_nulls/mod.rs:172-184 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"364a87d8aac9be4941b99423c660be6fba126dde5a21126fbaf9d777817f6cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): crates/polars-io/src/catalog/unity/client.rs:361-361 | crates/polars-io/src/catalog/unity/client.rs:364-364 | crates/polars-io/src/catalog/unity/client.rs:367-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 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/catalog/unity/client.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9317429e364787a57051539a831dd2d3797b2094d0824bd6ae8a3ea2fef1bf76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-core/src/frame/column/mod.rs:1405-1417 | crates/polars-core/src/frame/column/mod.rs:1418-1430 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8894beb930c58a9b3fb86291f24c09cf279f9abe5981e955faae46ad6faad8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-core/src/frame/mod.rs:701-716 | crates/polars-core/src/frame/mod.rs:724-737 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bcaa068fb3275e44a49b9bf1fdff32ac007156c9f707936a07cc40d0ca5020"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-core/src/utils/mod.rs:842-856 | crates/polars-core/src/utils/mod.rs:864-878 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f90b398424b5bfa9bbc7186a7e2bc8e70ff3548b5f539ebdbb70a28098a416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/polars-parquet/src/parquet/encoding/bitpacked/decode.rs:60-80 | crates/polars-parquet/src/parquet/encoding/bitpacked/decode.rs:83-105 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/bitpacked/decode.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71cb68a0b077cadea3412163de64424f48b15cabe2cb245a07c2ab2a5273268"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-core/src/frame/builder.rs:36-51 | crates/polars-core/src/frame/builder.rs:53-70 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/builder.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2eeab27809282b2b8046d95b5d630b8e99d686bc38776fb3ad8080afbbfb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-expr/src/reduce/bitwise.rs:12-24 | crates/polars-expr/src/reduce/bitwise.rs:26-38 | crates/polars-expr/src/reduce/bitwise.rs:40-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/bitwise.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf0666eab84386df6e2dca62aba57f63cb79b63ae278bf01e956207f369f140"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-io/src/csv/write/write_impl/serializer.rs:155-166 | crates/polars-io/src/csv/write/write_impl/serializer.rs:170-180 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1246c3eb873ed6e4632e79e63d41bb38687f580a6c49eaf14d82996d07b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/polars-ops/src/chunked_array/strings/pad.rs:64-75 | crates/polars-ops/src/chunked_array/strings/pad.rs:81-92 | crates/polars-ops/src/chunked_array/strings/pad.rs:98-109 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/pad.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae3c605cad2f6d5edba611f5a3951084ce5fae201f6a606d3855f1210a307f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-ops/src/series/ops/is_in/mod.rs:519-526 | crates/polars-ops/src/series/ops/is_in/mod.rs:567-578 | crates/polars-ops/src/series/ops/is_in/mod.rs:584-595 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c523e8aa255a9fec3100f4243ab70b0b5c1ac61ef3136eeffec1c2a73eeb0121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs:183-199 | crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs:208-220 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"234a79716e4a57450f88c2bc4f964cec741374e378e6ea2ca59127e17187efa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): py-polars/src/polars/expr/expr.py:11410-11471 | py-polars/src/polars/expr/list.py:203-263 \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":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":11410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae34ef8fe29bacba26ba8ab7d887ed02914b5844628d09158700f3a6cd6fffcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-compute/src/sum.rs:54-63 | crates/polars-compute/src/sum.rs:69-78 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/sum.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c20da7b373da943da045a3414f5e2c4c5437a46cb66cc55a092b2affefe58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-core/src/chunked_array/temporal/string/infer.rs:142-164 | crates/polars-core/src/chunked_array/temporal/string/infer.rs:169-188 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/infer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf58b3b1003cff0df95474dd728f954b19e7fe321e3f9fc6548017cc39a15de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/polars-expr/src/dispatch/random.rs:14-30 | crates/polars-expr/src/dispatch/random.rs:37-53 | crates/polars-expr/src/dispatch/shift_and_fill.rs:112-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/random.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4a2e867b959c660b8fdd445ace3490c5005bca9ecda8ba666d8af8f24c3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/polars-expr/src/reduce/any_all.rs:46-55 | crates/polars-expr/src/reduce/any_all.rs:145-154 | crates/polars-expr/src/reduce/any_all.rs:248-260 | crates/polars-expr/src/reduce/any_all.rs:374-386 | crates/polars-expr/src/reduce/min_max.rs:441-455 | crates/polars-expr/src/reduce/min_max.rs:557-571 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dd270e9b2f814ee94966948aa5d2a4d4f32d36fd576312c5adcf0e34ca842c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-ops/src/chunked_array/array/namespace.rs:43-55 | crates/polars-ops/src/chunked_array/list/namespace.rs:156-168 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/namespace.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e77f86e73e1eac1c8b9a90a955a1a5d1db3ceea04c0d800c139d499cd92d993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-ops/src/series/ops/is_last_distinct.rs:116-126 | crates/polars-ops/src/series/ops/is_last_distinct.rs:133-143 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_last_distinct.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c027a3e1cce51c6948e2ad6232d78dbfadc11e4cb1a7447369c6a062b6b1e2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/binview/optional.rs:16-37 | crates/polars-parquet/src/arrow/read/deserialize/binview/required_masked.rs:17-39 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/optional.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c5ca6d44cba6e64291cf116b87c282108e52f879a0320a22cc66b4935cc578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:171-185 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:404-415 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5e2c286e31d2411f2f0e5d0018d2e0288f1e4897ab1ff0876eb6fc83c644f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:924-933 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:935-946 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d0f73272509f00acff214b0af58d246ba79ab313659fb7daaef7f890d715af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-utils/src/mem.rs:21-35 | crates/polars-utils/src/mem.rs:40-54 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/mem.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0c9cafc72d667dd7ef3ff23abe95649db0696ba339a6a0c5c6bc5d9f7b338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): py-polars/src/polars/selectors.py:235-246 | py-polars/src/polars/selectors.py:256-271 \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":"py-polars/src/polars/selectors.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"63662369ce24074688c8a7d430620fa71619fc2f60977fca294ec932301f3679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-core/src/chunked_array/ops/append.rs:168-178 | crates/polars-core/src/chunked_array/ops/append.rs:183-193 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/append.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"42124756b14acb1b55a4a03b9ef9eb0cf06a0a2098931a0697f66019e8eb39fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/reduce/min_max.rs:333-344 | crates/polars-expr/src/reduce/min_max.rs:382-393 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dd06ade7719535c58e11c04da5ca8cf4493e55e93a94a7ad559d52b41f3086"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/polars-json/src/json/write/serialize.rs:419-430 | crates/polars-json/src/json/write/serialize.rs:441-452 | crates/polars-json/src/json/write/serialize.rs:463-474 | crates/polars-json/src/json/write/serialize.rs:484-494 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c09c11c366c000b16f989fe8e41a1d3937d73ad39f4d5b8832bf147318ceae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-ops/src/chunked_array/list/min_max.rs:16-32 | crates/polars-ops/src/chunked_array/list/min_max.rs:127-143 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d626034b838b77d28ad976432ab098b1115734c8d009410d3c4f021610600a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-stream/src/nodes/io_sources/ipc/builder.rs:63-79 | crates/polars-stream/src/nodes/io_sources/parquet/builder.rs:85-106 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/builder.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc3d1669ae98000cf8a7d60f12dab38a9bbe42fbcdd600c75666843011ab18c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-utils/src/order_statistic_tree.rs:291-301 | crates/polars-utils/src/order_statistic_tree.rs:458-468 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"38383df6ef26b46488b52f42a157bda4f3d364248ec2f0fc649231735e4dc9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-compute/src/if_then_else/scalar.rs:8-16 | crates/polars-compute/src/if_then_else/scalar.rs:23-30 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/if_then_else/scalar.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6247c98d330ea7294fef2ac0c4b9a6efca4be3b76f4fa59c966b68f90249b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-core/src/utils/mod.rs:1264-1279 | crates/polars-core/src/utils/mod.rs:1284-1302 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b2b5a8b8772fcdefba53f37bcbe8f31a908cfcc51d357e011a36cf90af56ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-expr/src/dispatch/range/linear_space.rs:347-357 | crates/polars-expr/src/dispatch/range/utils.rs:213-221 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b4012dc8101994ebd8968ad1502e9ad79bc7f508155232338c264a929f182c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-expr/src/reduce/mod.rs:545-552 | crates/polars-expr/src/reduce/mod.rs:799-807 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"adefb658c50f107db7d3e2fc118694d5d6ff2a9c09c2578345f0db57821dc4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-ops/src/chunked_array/array/count.rs:10-18 | crates/polars-ops/src/chunked_array/list/count.rs:44-52 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/count.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ded670d5149343a1ea8b15e2e249dfe2ecbeaf2ed34ea36d7bca0619436673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:152-165 | crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:227-245 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/boolean.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3e81573eaa3adca734f8138a284ac9f92d7f6281cd0487a6e17b0eab8fa6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-python/src/conversion/mod.rs:424-434 | pyo3-polars/pyo3-polars/src/types.rs:80-89 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8fd72cb9c9465eaa18546ed377627acac6d5bbbe673c762d5ac46a8f61c066"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): py-polars/src/polars/_utils/various.py:99-115 | py-polars/src/polars/_utils/various.py:161-173 \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":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68bb120860e0f6c8b2b200a0efd35e2d2d60bcd22684d576cf559e2c2c06154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-compute/src/ewm/cov.rs:148-157 | crates/polars-compute/src/ewm/cov.rs:176-186 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/cov.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e614cc7afc540967905fa15b18c8e6aa705fb62494bd3391cee98e5451d7c073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-ops/src/chunked_array/strings/find_many.rs:147-157 | crates/polars-ops/src/chunked_array/strings/find_many.rs:245-255 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ab9de76bcfbffcb6e9eb5a465daf4b1a21ad776e0fee4790c50648c07b940e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-python/src/interop/numpy/to_numpy_series.rs:259-269 | crates/polars-python/src/interop/numpy/to_numpy_series.rs:494-506 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/numpy/to_numpy_series.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"51417269389986c89bc9596b71acef6b3988a2aca5d70e49e204700e78185192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-expr/src/reduce/first_last.rs:588-595 | crates/polars-expr/src/reduce/first_last.rs:603-610 | crates/polars-expr/src/reduce/first_last.rs:618-625 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a73b2b6da2ce31feb32eb6d346f7ca94f1ed2256f1932f4321ece9bba956f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-ops/src/series/ops/moment.rs:16-26 | crates/polars-ops/src/series/ops/moment.rs:37-47 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/moment.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fb953f351186a6b7fe3350ef668428d9397fdb4ad8a3d8c0abdd8521ea3419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/dsl/file_scan/mod.rs:395-408 | crates/polars-plan/src/dsl/file_scan/mod.rs:411-423 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7118c6c193ccedefb11eb7c3481da10d50ab8743c2e35b2a382eae7835f8a6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-compute/src/rolling/min_max.rs:26-40 | crates/polars-compute/src/rolling/min_max.rs:70-83 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/min_max.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1eabb67d0c0c164d3834caee56c1556b52b5c05db15fc2be87cedf4522a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-compute/src/rolling/quantile_filter.rs:147-158 | crates/polars-compute/src/rolling/quantile_filter.rs:160-171 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/quantile_filter.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8836a8257715a126e637dd845fc67672e62b158ebd9b379f2ca4aa9e25ea9a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-plan/src/dsl/dsl_resolver/mod.rs:37-46 | crates/polars-plan/src/dsl/dsl_resolver/mod.rs:134-141 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dsl_resolver/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"17595d3f6a6a37493cfc900643712d2fa2af18892eb3ba4e953d441815744e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): py-polars/src/polars/expr/expr.py:3108-3181 | py-polars/src/polars/lazyframe/frame.py:6523-6594 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca6b134e40cbdcbcca35dcae77cb6a6fc2bc8fb352d5a17b2875b72dc01248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/polars-expr/src/expressions/window.rs:227-256 | crates/polars-expr/src/expressions/window.rs:275-294 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad543048e8707f5d3f04ab5f0d7fb8fba4ab35da8d3d8e86504470aeec779c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/polars-expr/src/reduce/first_last.rs:206-217 | crates/polars-expr/src/reduce/first_last.rs:284-294 | crates/polars-expr/src/reduce/first_last.rs:340-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 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"00590e50f83c3dcbb6092eadbe4f4720604d8485897c2e6faf19350f6f205dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-plan/src/dsl/function_expr/bitwise.rs:26-43 | crates/polars-plan/src/plans/aexpr/function_expr/bitwise.rs:66-83 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/bitwise.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36e60b54a5aafe67739547435f394996b78ebf988920c27406f554761a7571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-sql/src/context.rs:2624-2636 | crates/polars-sql/src/context.rs:2652-2663 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5289e590b95cd66ae8f99d06975fe803c8d02ef730e766d8704b1563aa18b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/polars-core/src/chunked_array/object/iterator.rs:29-47 | crates/polars-core/src/chunked_array/object/iterator.rs:118-136 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/iterator.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0d12faa1e0c5261605bb9be5d2acb424824ff76f16becafd39c26d92b345f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/polars-expr/src/reduce/bitwise.rs:238-243 | crates/polars-expr/src/reduce/min_max.rs:517-522 | crates/polars-expr/src/reduce/min_max.rs:633-638 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/bitwise.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"406beceb98efec18fa8129d72d29b07af0e2818629218d4a4389601f8e44f870"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-python/src/conversion/mod.rs:1232-1247 | crates/polars-python/src/conversion/mod.rs:1253-1267 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"12762ca5a7831d552eb23ec52fe2bfbaaabdec9444a1beb3b14b200de9e33c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): py-polars/src/polars/series/series.py:1123-1127 | py-polars/src/polars/series/series.py:1231-1238 \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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf34b076e73f1e8e881c69c38c921014a147af4638b45b1ee8c808f6e393275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-arrow/src/ffi/schema.rs:150-162 | crates/polars-io-ext-ffi/src/common.rs:418-430 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io-ext-ffi/src/common.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd97ddc7d31c6e2cd9f1819d7c4e0c1cf2c373763021758573c4461ebb382f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-core/src/frame/column/mod.rs:661-666 | crates/polars-core/src/frame/column/mod.rs:668-675 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6d9108ac592f7d2fa565a2747e4dd10890e2bbb27b155e66aaaab6025296ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/dispatch/array.rs:160-172 | crates/polars-expr/src/dispatch/list.rs:299-310 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/array.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"21726776a7104cb8051f51b6d901877505173836ab8aa2a8c1fb1b85ab7cae42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-expr/src/idx_table/binview.rs:45-59 | crates/polars-expr/src/idx_table/row_encoded.rs:40-54 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2779a3da284ffa9f58f76f46bd9c55d6e26b328240f64a957886d72f86191baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-ops/src/chunked_array/list/min_max.rs:38-44 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:187-193 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a2a7b85ec0e5dd73587e453067b05da74eb0092c9712e6fa3806315248f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:577-590 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:724-736 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:794-806 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762b06020b27f60ac78ee1aa9cfd672e926140c9d8938702fa5c1f6e48ea967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-plan/src/plans/functions/mod.rs:193-204 | crates/polars-plan/src/plans/functions/mod.rs:206-217 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a923c2fb5f77ea4091f079724fe19016ec0a53786fbbc781d71bc9e02df154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-sql/src/subquery.rs:2705-2721 | crates/polars-sql/src/subquery.rs:2739-2755 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb3359fa23b1df8526cc4dbf834617a3b16f7d11da3d34e1d4f68989c6defe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): py-polars/src/polars/_utils/deprecation.py:65-77 | py-polars/src/polars/_utils/deprecation.py:86-111 | py-polars/src/polars/_utils/unstable.py:50-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 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":"py-polars/src/polars/_utils/deprecation.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"030edf13275690058049c67cd4f9130936281589e1f832eb4ad80a5555749a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): py-polars/src/polars/io/parquet/encryption/_properties.py:68-84 | py-polars/src/polars/io/parquet/encryption/_properties.py:126-138 \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":"py-polars/src/polars/io/parquet/encryption/_properties.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99242222595b001083458094715b8884fd70670879e841a81dc1565635c06e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-compute/src/cardinality.rs:127-142 | crates/polars-compute/src/cardinality.rs:144-159 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cardinality.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4586b91be43057599efa832927e35b1d6e1f4fae6ccb892a11520df69e5f266d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/polars-compute/src/filter/avx512.rs:54-63 | crates/polars-compute/src/filter/avx512.rs:74-81 | crates/polars-compute/src/filter/avx512.rs:91-98 | crates/polars-compute/src/filter/avx512.rs:108-115 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/filter/avx512.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588097bfaf410672a10c2da73e8bb1edf234540511567569f8eb2f017c24c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-expr/src/key_rows/layout.rs:134-142 | crates/polars-expr/src/key_rows/layout.rs:147-155 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/key_rows/layout.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e3edb552a71ef7f7c3c356cca2fa864d4c089e81b210f56fa5ca2325c0ae7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:241-255 | crates/polars-parquet/src/arrow/read/deserialize/primitive/mod.rs:50-65 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"982e798c11b723e95998680c90c192ccac97a3b08dc393902219390fde5a30de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/polars-python/src/catalog/unity.rs:435-458 | crates/polars-python/src/catalog/unity.rs:472-493 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/catalog/unity.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada1c050c31c7fdc561a92a3e00d3b729f210b29ebb5dc55e8ac4b402c47428"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-compute/src/cast/utf8_to.rs:35-43 | crates/polars-compute/src/cast/utf8_to.rs:46-54 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/utf8_to.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c987868284dd6ac135430db4ca17cfa27116bf7f421d0b91f67ff52c50691c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-io/src/csv/read/read_impl.rs:531-547 | crates/polars-io/src/ndjson/core.rs:156-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":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fa0ae9cef829b070bc2f2647ce30df7be437d61aab54c696d7a88b80737b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-ops/src/series/ops/is_first_distinct.rs:16-25 | crates/polars-ops/src/series/ops/is_first_distinct.rs:27-36 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd89b4d6375893807321cdc3b92ef9e2d0c0e181f81d5060e2de69a4c304990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs:708-725 | crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:193-208 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested_utils.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dd706b58d0ff32e70da5c0679833e944fc8315c11057cf9209612644cd87b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-plan/src/dsl/builder_dsl.rs:473-486 | crates/polars-plan/src/dsl/builder_dsl.rs:497-512 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/builder_dsl.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e591e75ea165c1685209e4a3347833c947c2139e57fe900cbf4d7e9a2a23326e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/polars-sql/src/functions.rs:2658-2667 | crates/polars-sql/src/functions.rs:3019-3029 | crates/polars-sql/src/functions.rs:3032-3040 | crates/polars-sql/src/functions.rs:3195-3203 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e358338a9134b0aaf633f6f193a82dca684768de3e33079582004fc422d750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-sql/src/lateral.rs:63-75 | crates/polars-sql/src/subquery_group_by.rs:41-50 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce2bed81e8359f4de721772b73fba39db9c90a4ce5f73c950baa86ed71cc6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-expr/src/reduce/mod.rs:534-543 | crates/polars-expr/src/reduce/mod.rs:786-797 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbeca6e9c92d72f9b55b24db3150aaafa1cd55cfca269a8110940d8166844f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-python/src/lazyframe/general.rs:1004-1014 | crates/polars-python/src/lazyframe/general.rs:1016-1026 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea0c0b4bb47ffacb02fd38f750f74279872091cd7e5621c06b9375c85a02d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): py-polars/src/polars/dataframe/plotting.py:36-88 | py-polars/src/polars/dataframe/plotting.py:165-222 \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":"py-polars/src/polars/dataframe/plotting.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d32c866463e66531cc46c476faac303bb0294d18ff55d747b3d3c4a8002349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 58\u002B corresponding lines): py-polars/src/polars/functions/lazy.py:1555-1628 | py-polars/src/polars/functions/lazy.py:1640-1711 | py-polars/src/polars/functions/lazy.py:1721-1778 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 58 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f06fa72648d480adde94c0bd03af1984891f9643d91997e811ec05e8c6f30e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/polars-compute/src/arithmetic/mod.rs:40-51 | crates/polars-compute/src/arithmetic/mod.rs:52-63 | crates/polars-compute/src/arithmetic/mod.rs:65-76 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/arithmetic/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bb4eb9ae1795b9f89da367156419e3bf95263d5cc2383e1a811dba0dcc3e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-core/src/chunked_array/builder/list/primitive.rs:21-35 | crates/polars-core/src/chunked_array/builder/list/primitive.rs:43-55 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/builder/list/primitive.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dd41f6b690f242fefe8bb8a1c3d2994d42a0dcf9007bbbc74a91383bc4c7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-core/src/chunked_array/object/builder.rs:235-243 | crates/polars-core/src/chunked_array/object/builder.rs:252-265 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/builder.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bcda25e54869bd040369a6c467bcee371e5d383330803aa7c40708b8242178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-core/src/chunked_array/temporal/string/infer.rs:314-323 | crates/polars-core/src/chunked_array/temporal/string/infer.rs:328-336 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/infer.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"84767e9f38b799111d83d735c607d135f5c16d552216e2ce3bed8787841b6dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-core/src/frame/explode.rs:15-22 | crates/polars-core/src/series/mod.rs:695-702 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/explode.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c14e0e3287a8778af872b9342e4f1d555dfca6b8419e016511b68b1bbae4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-expr/src/reduce/cov.rs:32-48 | crates/polars-expr/src/reduce/cov.rs:178-193 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2dc7541dfeedd9ca94d7f7efd5de3d4945b2472bde02bac91eb542fe520b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-plan/src/plans/optimizer/sortedness.rs:34-50 | crates/polars-plan/src/plans/optimizer/sortedness.rs:180-196 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d389e10894459388764fc5eb7dbd94544ed1fb8b3dbf86c042fad2e59316635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/polars-plan/src/plans/visitor/expr.rs:16-30 | crates/polars-plan/src/plans/visitor/expr.rs:197-211 | crates/polars-plan/src/plans/visitor/lp.rs:63-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/visitor/expr.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f646a82392d38500bb0084fe6d384dfbe01556d0d44f29e164420969821bd2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-sql/src/context.rs:1669-1677 | crates/polars-sql/src/context.rs:1679-1687 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f136a4f5cfcf2b2919250c6a45050915db43e535674e86c5704f7a1e710bba75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:560-569 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:573-582 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"46557fac390df0036e73ad015ccde90522fa7d3f45889aa6c51d2f61a47a64b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (146 corresponding lines): py-polars/src/polars/lazyframe/frame.py:4602-4769 | py-polars/src/polars/lazyframe/frame.py:4782-4927 \u2014 These two members are one piece of code written twice and then edited apart: 146 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20344f8e673920402384f0799395fc070b2ef16018cdf2347d837fc11a6398f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/frame/column/scalar.rs:156-165 | crates/polars-core/src/frame/column/scalar.rs:172-182 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/scalar.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5345fab763d713dba487b0f3532ff6178d968aca10bfd8a1ba47e815ad8bdc62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-expr/src/dispatch/boolean.rs:93-100 | crates/polars-expr/src/dispatch/boolean.rs:102-109 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/boolean.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e8c92850c4256bc0e305bc7dc42a80f9cf6955c1721c2740d5cf46ad9cc77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-ops/src/frame/join/hash_join/mod.rs:66-83 | crates/polars-ops/src/frame/join/hash_join/mod.rs:93-110 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc83dd889da7f6e35ca0c15863df6b7bd366c75c2d811763d2aa9d3757a6822"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-parquet/src/parquet/encoding/bitpacked/decode.rs:30-38 | crates/polars-parquet/src/parquet/encoding/bitpacked/encode.rs:44-52 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/bitpacked/decode.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7acf09c86c14b09d8c62e1c8d59e65d0f8ead8ad07ad9477877cb88f60d112"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-plan/src/plans/options.rs:705-714 | crates/polars-plan/src/plans/options.rs:717-726 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129763cf2c9c2a31ba4b6c5bb575f9b91af180c819292654df5ae19ff4382f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-compute/src/cast/primitive_to.rs:250-257 | crates/polars-compute/src/cast/primitive_to.rs:278-285 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/primitive_to.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacb7274ca2da0731f92eb644e439a1a56584b2c4962c35eea578b9a608fcc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-expr/src/groups/key_rows.rs:176-190 | crates/polars-expr/src/groups/single_key.rs:276-285 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/key_rows.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d351c55a3eae05c9983b06bfce67ec54ef687ebb9924f20596ba134061946a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/polars-expr/src/reduce/first_last.rs:192-199 | crates/polars-expr/src/reduce/first_last.rs:271-277 | crates/polars-expr/src/reduce/first_last.rs:327-333 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c71610e6228a4cc290d5edd71285ed226566ea1f35e82200d47e353ed3d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-io/src/predicates.rs:444-454 | crates/polars-io/src/predicates.rs:458-469 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8b457848e2b8fcf527bceb23211ca9434c4a48106930f6a27ee455cf0ecd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-ooc/src/spill_token.rs:896-904 | crates/polars-ooc/src/spill_token.rs:907-915 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_token.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffd194f1cf502e3f93c452a86967e0bf7f6e834e5a2f9b390217f50862b7e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-python/src/conversion/mod.rs:1291-1303 | pyo3-polars/pyo3-polars/src/types.rs:95-107 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c262e350e92d5add75f397cc6e41e4ba9828656f09d06a12824a1645c4002cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-python/src/functions/eager.rs:68-79 | crates/polars-python/src/functions/eager.rs:86-97 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/eager.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f2dfcd763601b0832ba399ba615013f8dd5735052bd77632ec2407b89b20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-core/src/chunked_array/ops/arity.rs:553-560 | crates/polars-core/src/chunked_array/ops/arity.rs:618-626 | crates/polars-core/src/chunked_array/ops/arity.rs:637-645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"917276495ffa45545ee8d3b77ed4bb41dd2e231dad58d4b39d0cc9740adb8a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/polars-core/src/series/mod.rs:311-320 | crates/polars-core/src/series/mod.rs:325-334 | crates/polars-core/src/series/mod.rs:344-353 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"232fed810a2f977c18de56949250371aab4290079b1224836e206e34ade8802d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): py-polars/src/polars/testing/asserts/frame.py:172-240 | py-polars/src/polars/testing/asserts/series.py:160-228 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/asserts/frame.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe90042924686e5b10ad9c49239bbe669d8102ec15f80290eeb6d56a1a20496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-core/src/chunked_array/ops/fill_null.rs:261-277 | crates/polars-core/src/chunked_array/ops/fill_null.rs:279-300 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/fill_null.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb11431f0b60345c3d65d6f3e2abff45f3ef7af3c7ed5cb2c04e58505765568a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/chunked_array/ops/nulls.rs:25-34 | crates/polars-core/src/chunked_array/ops/nulls.rs:36-45 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/nulls.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9744b6d7f71a02b647210fae486248e282f6f367fb14409bddab39249013eb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/polars-expr/src/reduce/min_max.rs:669-681 | crates/polars-expr/src/reduce/min_max.rs:736-748 | crates/polars-expr/src/reduce/min_max_by.rs:628-642 | crates/polars-expr/src/reduce/min_max_by.rs:682-696 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda1928e75740b85f66c92a11aa851fedddd0eee2e11fe1da1fb8933f22c7cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-io-ext-ffi/src/common.rs:90-101 | crates/polars-io-ext-ffi/src/common.rs:224-233 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io-ext-ffi/src/common.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f80b4858e621eaca8db38f6a31fad88031877e322e51f6169a7d6e5f3250bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-io/src/csv/write/write_impl/serializer.rs:111-119 | crates/polars-io/src/csv/write/write_impl/serializer.rs:121-129 | crates/polars-io/src/csv/write/write_impl/serializer.rs:133-140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c711e630d4b534c0404667132f9a8408dbbb12e5f39abbedc08b28812a2425d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-plan/src/plans/ir/inputs.rs:455-465 | crates/polars-plan/src/plans/ir/inputs.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":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c18adfafd8b6bb304129059a108eb26c4dd7bfac184c7e60c90995eadc518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-python/src/conversion/mod.rs:954-966 | crates/polars-python/src/conversion/mod.rs:1051-1063 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87bca983be3cc5390e904dfa35db4d1409dd4ef9ce3145e383447a35b2d80a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-python/src/sql.rs:363-374 | crates/polars-python/src/sql.rs:383-390 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3ecf15498a06af55a1ba1a1e624181fa74b4fa12c9dc542ffd459e4933f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-time/src/windows/index_space.rs:84-93 | crates/polars-time/src/windows/index_space.rs:96-103 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/index_space.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7e9aba7691b17a4c9f7d5b91bdf0de8810f3fdef2fbd31c062f4bc19acf7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/polars-arrow/src/ffi/array.rs:69-86 | crates/polars-arrow/src/ffi/mmap.rs:73-90 | crates/polars-arrow/src/ffi/schema.rs:24-40 | crates/polars-ffi/src/version_0.rs:43-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 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ffi/src/version_0.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d836a5e0599fe49e866259fe62bf49ecbdac558d2ebdc4beed5524d4316e3e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-core/src/chunked_array/arg_min_max.rs:21-27 | crates/polars-core/src/chunked_array/arg_min_max.rs:33-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db45d12de32f3174e4473407e8f643c81f59c1a74a94bfb87e404c083a4f136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/polars-core/src/runtime.rs:72-87 | crates/polars-core/src/runtime.rs:92-107 | crates/polars-core/src/runtime.rs:121-131 | crates/polars-core/src/runtime.rs:133-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/runtime.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e097d742561e6c4b21a594b3241177121763a52edfdb794147155bbe2aa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-io/src/parquet/read/async_impl.rs:81-92 | crates/polars-io/src/parquet/read/reader.rs:136-146 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/parquet/read/async_impl.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383697ddb39a34995550553b68f1ca9a6a4057cdd583ecb212e942c26a53184"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-ooc/src/spill_context/stats.rs:220-231 | crates/polars-ooc/src/spill_context/stats.rs:233-246 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/spill_context/stats.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dddae8747d301aa16816c028721a93261c42f646c3c60b843156b2772b306e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-ops/src/chunked_array/strings/namespace.rs:716-723 | crates/polars-ops/src/chunked_array/strings/namespace.rs:725-732 | crates/polars-ops/src/chunked_array/strings/namespace.rs:734-741 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e601563429d4481639316ca285cdfa64b9b840a32df0366afcc1283b5764a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-ops/src/frame/join/cross_join.rs:27-36 | crates/polars-ops/src/frame/join/cross_join.rs:38-46 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/cross_join.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"08628b65170aff6d31af79da8352ecf2669febc32d73d6a1fd7839dc3513bd50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-ops/src/series/ops/is_close.rs:81-89 | crates/polars-ops/src/series/ops/is_close.rs:100-107 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_close.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efc1bee62a40003cdfc9531a51e79f3dccb16424b16e218e19d9cffacd0f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-plan/src/dsl/functions/horizontal.rs:14-27 | crates/polars-plan/src/dsl/functions/horizontal.rs:91-106 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/horizontal.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc09e6fd05ccb896008d22a789c8d5b90b29cb17a17d69b39f70be7a08384cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-stream/src/nodes/io_sources/multi_scan/functions/mod.rs:18-30 | crates/polars-stream/src/nodes/io_sources/multi_scan/functions/mod.rs:60-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":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f35db952e87a6062d5051ff8ce186096217f797c90cfa8225b80a62e5f53b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/polars-time/src/windows/group_by.rs:539-552 | crates/polars-time/src/windows/group_by.rs:564-577 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"098a0ce49ce90a50a02d255722806e51e586042664ee187f9f92e4060b3bc7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): py-polars/src/polars/lazyframe/opt_flags.py:46-61 | py-polars/src/polars/lazyframe/opt_flags.py:94-111 \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":"py-polars/src/polars/lazyframe/opt_flags.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59aed9ff6fa6acf283102f1abd84cda7c923567ddf90cc2be4a2b4462b2cee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-expr/src/dispatch/strings.rs:167-179 | crates/polars-expr/src/dispatch/strings.rs:187-199 | crates/polars-expr/src/dispatch/strings.rs:207-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6938ad5452b442f75ef2582bd4b119cb3fc4f1be3c9f8065d0676086f4c14280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/polars-expr/src/reduce/any_all.rs:316-323 | crates/polars-expr/src/reduce/any_all.rs:442-449 | crates/polars-expr/src/reduce/bitwise.rs:229-236 | crates/polars-expr/src/reduce/min_max.rs:508-515 | crates/polars-expr/src/reduce/min_max.rs:624-631 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"923e31155e72df6d6d1578da61e81d3b88a272e3600b2cddda01a4b7739ca4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-io/src/parquet/write/batched_writer.rs:53-68 | crates/polars-io/src/parquet/write/batched_writer.rs:164-175 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/parquet/write/batched_writer.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc44057653981af94cac14ace92cd00eae43c92e1a4084adb0672610957540f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:189-204 | crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:171-188 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"722c0920d449c455605e1ce87bab77e1b2b89c4321263b241cca9f2a2f2ff7ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:655-665 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:668-678 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:681-690 | crates/polars-parquet/src/parquet/types.rs:240-252 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d642bbdcf97b3110ec7b99a9c4d95a647ef25d2311c036feabdf5bdfd9238bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-plan/src/dsl/function_expr/correlation.rs:17-26 | crates/polars-plan/src/plans/aexpr/function_expr/correlation.rs:13-22 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/correlation.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b821a25c7fbe51ba9c462799da1b15aab425d4d34d407ab0c550a261ee54d4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/polars-plan/src/dsl/functions/concat.rs:108-117 | crates/polars-plan/src/dsl/functions/concat.rs:120-129 | crates/polars-plan/src/dsl/functions/concat.rs:146-150 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/concat.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf68ec0a511772ec875b5978c7d8652993e5699280a45c5390bc8a7d4a0132d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/polars-plan/src/dsl/scan_sources.rs:157-170 | crates/polars-plan/src/plans/lit.rs:70-78 | crates/polars-plan/src/plans/lit.rs:82-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":"crates/polars-plan/src/dsl/scan_sources.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a58d1526d82e03865cc127e65f0b79ecad83f4d2c99abf4eceed3ce16453b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/polars-sql/src/context.rs:702-712 | crates/polars-sql/src/context.rs:721-732 | crates/polars-sql/src/context.rs:741-751 | crates/polars-sql/src/context.rs:760-770 | crates/polars-sql/src/context.rs:780-790 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d1061fab18194be08b7a7cf045132fac69feda9924d34157700da355e238e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/polars-utils/src/clmul.rs:42-55 | crates/polars-utils/src/clmul.rs:64-77 | crates/polars-utils/src/clmul.rs:89-102 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/clmul.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f846962e5d4abb3e45d220330e851b587c8b88b3737ad610b85a2d690076bf14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/polars-core/src/frame/mod.rs:120-129 | crates/polars-core/src/frame/mod.rs:131-137 | crates/polars-core/src/frame/mod.rs:142-151 | crates/polars-core/src/frame/mod.rs:153-159 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da466a7ce97b17229f79d0cade598364a151e6319f64a123aed68154e23034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/utils/mod.rs:884-893 | crates/polars-core/src/utils/mod.rs:899-908 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"8879983b087facb99599dcd319d4223ab4644ad45f3c8948e5c7584e41c1e4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-expr/src/dispatch/range/datetime_range.rs:67-76 | crates/polars-expr/src/dispatch/range/datetime_range.rs:84-93 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/datetime_range.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d462be2777bd2ba61fbd3d3887cf2f0a06914b4b347d0dbc68111961e8fdfce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-expr/src/reduce/cov.rs:160-168 | crates/polars-expr/src/reduce/cov.rs:303-316 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52ce3618503e26535f0fa2eb14a754b557664d0c7617ec4f0aefcc046372316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-ooc/src/decay.rs:247-258 | crates/polars-ooc/src/decay.rs:268-280 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/decay.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e456080e7f9b5ad653820d6d08724cd5279a16fc5c4f78101057a46b9a7040e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-parquet/src/parquet/statistics/boolean.rs:46-57 | crates/polars-parquet/src/parquet/statistics/primitive.rs:47-58 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/statistics/boolean.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"431ab4e037e8ba3a466295d7ac60d96ca99b36df2247477a10865ca66a1d812e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-plan/src/dsl/options/sink.rs:505-523 | crates/polars-plan/src/plans/options.rs:506-522 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/sink.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815c95ee99b02a1cbd4921fec823074fc60e0eda80496c1f40aee067fd50a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-python/src/conversion/mod.rs:996-1009 | crates/polars-python/src/conversion/mod.rs:1092-1104 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc23f78866300b7e59c0ade474b49eb39bbb62d42615e5c3ad8b31b3644a3c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-python/src/functions/io.rs:185-193 | crates/polars-python/src/functions/io.rs:197-205 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/io.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c937f0db3e71654fed1527ead8312db1cd4edb281393d4b15f0070a998907bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): py-polars/src/polars/functions/lazy.py:2621-2652 | py-polars/src/polars/functions/lazy.py:2670-2696 \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":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcb3c2c041f18d42acf005deb64fb56b088af4a93f160f59a0ba579357bc857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-compute/src/ewm/cov.rs:201-206 | crates/polars-compute/src/ewm/cov.rs:223-228 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/cov.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2206fbaa06d694140209cfb349db788583c4e5f11a834ac18e9e634cfbace1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/chunked_array/comparison/scalar.rs:97-106 | crates/polars-core/src/chunked_array/comparison/scalar.rs:119-128 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/scalar.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12479199566f83417da274c9f65e7fc408cd7c927a1d4881de3495cc694779a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-io-ext-ffi/src/common.rs:389-393 | crates/polars-io-ext-ffi/src/common.rs:399-403 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io-ext-ffi/src/common.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe41b026acd2743d7eb1568b081a35eb4b55aa2718f57c42b62acec0f76b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/polars-io/src/catalog/unity/client.rs:200-218 | crates/polars-io/src/catalog/unity/client.rs:279-294 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/catalog/unity/client.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"679660e49877cb13fe928e638b32a4610fb639ef56cc8b295e8add658ef90080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/polars-plan/src/dsl/dsl_resolver/python.rs:161-171 | crates/polars-python/src/dataset/dataset_provider_funcs.rs:19-29 | crates/polars-stream/src/nodes/io_sources/external_python/mod.rs:89-101 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dsl_resolver/python.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90b044c9897d1252d37b7b429b8df131cb0b2dc5311681d5f73b9a925aacbdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/polars-plan/src/plans/aexpr/properties/general.rs:99-116 | crates/polars-plan/src/plans/aexpr/properties/general.rs:408-427 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/properties/general.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"36180a3c95c0ef84bfa2c9cb0d1ba684adec6fca85ebc52ee59ed880a7aedd2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-plan/src/traversal/tree_traversal.rs:265-273 | crates/polars-plan/src/traversal/tree_traversal.rs:275-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":"crates/polars-plan/src/traversal/tree_traversal.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"446647c4698435f93e8863a2fa85bece235eb8597925ce1fb6a19214f8d99536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:188-203 | crates/polars-stream/src/nodes/io_sources/parquet/mod.rs:234-249 | crates/polars-stream/src/nodes/io_sources/shared/file_init.rs:128-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"172efce63e2aad68c368b400717e810c1f8f157d1347ab9ecb1e40eb3e4f0d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:233-239 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:244-255 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:326-337 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:341-352 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:522-535 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:539-552 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96987eba379e9f9cda82437c7110250fdefbd72eece708c43846db55ff28eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): py-polars/src/polars/_utils/convert.py:91-107 | py-polars/src/polars/_utils/convert.py:111-122 \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":"py-polars/src/polars/_utils/convert.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f724a63caa100936e17463062b786f28d6015ad585d389c5190035334f1b5450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): py-polars/src/polars/series/plotting.py:78-115 | py-polars/src/polars/series/plotting.py:122-158 \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":"py-polars/src/polars/series/plotting.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d062fa3d5d4b35aa97aafb91f1909663a7ca1dc45ab1c04f634c274399604ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-compute/src/rolling/no_nulls/quantile.rs:38-49 | crates/polars-compute/src/rolling/nulls/quantile.rs:36-46 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/quantile.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ded95d9e8c2a922eb6be64fb02b9a68153d52e6fb18ca91c8b1e3820c55b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-ops/src/chunked_array/binary/namespace.rs:80-86 | crates/polars-ops/src/chunked_array/strings/namespace.rs:915-922 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/namespace.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c2cfc3a1df4fa3539e9c35f5e4dd519381e2a4901e9cc112c2ea4c72229617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-python/src/functions/range.rs:173-179 | crates/polars-python/src/functions/range.rs:187-193 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb08c9de020fc1652d93264a5d9faaca49fba0f6c20efe33b8831c564f076fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-stream/src/nodes/group_by/tuning.rs:114-125 | crates/polars-stream/src/nodes/window/tuning.rs:60-71 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/tuning.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d181e7bce415db103d4bbf120aa0cb0a09906b466a0a6834ad9d975168dff7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/polars-stream/src/physical_plan/lower_expr.rs:2975-2986 | crates/polars-stream/src/physical_plan/lower_expr.rs:2996-3007 | crates/polars-stream/src/physical_plan/lower_expr.rs:3281-3292 | crates/polars-stream/src/physical_plan/lower_ir.rs:101-112 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1581fa216a0e3ce7c1869727a96b7820a99dcc37df3690b538f62110f8fe3bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-utils/src/order_statistic_tree.rs:313-321 | crates/polars-utils/src/order_statistic_tree.rs:351-359 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dacb7eb6b6b41d4187f222ccc14beec74b5191ce6568ea800121f5343c7433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-utils/src/order_statistic_tree.rs:324-329 | crates/polars-utils/src/order_statistic_tree.rs:362-367 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/order_statistic_tree.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8543851cee604c0bdde9f6595173193cbe7e1f77783b9a6e42a45969e0884769"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): py-polars/src/polars/datatype_expr/struct.py:16-24 | py-polars/src/polars/expr/struct.py:27-75 \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":"py-polars/src/polars/datatype_expr/struct.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aa285fd4aca3b1bdd7e16fd3ff96833cc7d25543e2b7fc016289acc02a96dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-compute/src/rolling/moment.rs:312-318 | crates/polars-compute/src/rolling/sum.rs:174-180 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/moment.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3762dfd7d9fdcb1e43bd18ce5270a9251bcd269c6bba5893d874514b64c4bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-core/src/frame/column/mod.rs:1611-1618 | crates/polars-core/src/frame/column/mod.rs:1619-1626 | crates/polars-core/src/frame/column/mod.rs:1627-1634 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acdfb73c9d57e91d78f2edf2f591456c21c9b7258a5205f7d6bbc9d2ae8802b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-core/src/frame/mod.rs:2085-2090 | crates/polars-core/src/frame/mod.rs:2123-2128 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bae6faddbd23418c526f364935f1360f8cba310f7ee3d66d258bc83341071f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-io/src/cloud/cloud_writer/internal_writer.rs:85-96 | crates/polars-io/src/cloud/cloud_writer/io_trait_wrap.rs:68-79 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/cloud_writer/internal_writer.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d4e237bd3d0fbf0bdcb81ff2dcb33bb97a33066fc471cb79618acd139b77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-python/src/conversion/mod.rs:918-930 | crates/polars-python/src/conversion/mod.rs:936-947 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcf0b141d90bf3eea71d854ba67593758109028db34974869863c3d3d342f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-arrow/src/bitmap/immutable.rs:390-401 | crates/polars-buffer/src/buffer.rs:296-308 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/buffer.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc4f15f1b60ff31ea96788408f1b4da718d3ff4abac227b8fe9d8700e120ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-compute/src/cast/binview_to.rs:76-82 | crates/polars-compute/src/cast/binary_to.rs:119-123 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/binview_to.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a83f65ee24ca7f39a84b0caa6a94bf223db52a25f5e44133789094f2087eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/polars-compute/src/rolling/nulls/moment.rs:18-35 | crates/polars-compute/src/rolling/nulls/moment.rs:46-60 | crates/polars-compute/src/rolling/nulls/moment.rs:71-85 | crates/polars-compute/src/rolling/nulls/quantile.rs:139-175 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/nulls/moment.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f48cbdedac57c5a6c8eb53915936975fe19a68556afa46939c38d3a8adb7252"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/chunked_array/arg_min_max.rs:137-146 | crates/polars-core/src/chunked_array/arg_min_max.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":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61f002371e5606ff23f7cc82907cda836ff763abe333750725554e9de09db34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/polars-expr/src/dispatch/boolean.rs:169-180 | crates/polars-expr/src/dispatch/business.rs:24-35 | crates/polars-expr/src/dispatch/business.rs:41-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 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/boolean.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6313dd123bee76f1700c2b6e9f2bc533f768ad457c200f3c3650b75d9349c424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/polars-io/src/utils/byte_source.rs:854-861 | crates/polars-io/src/utils/byte_source.rs:863-870 | crates/polars-io/src/utils/byte_source.rs:872-879 | crates/polars-io/src/utils/byte_source.rs:881-888 | crates/polars-io/src/utils/byte_source.rs:893-900 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/byte_source.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39df0c2856de143ddf7c5a5aced54902a15d1f5ae39fe67d591b138ae49e422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/polars-plan/src/dsl/mod.rs:563-576 | crates/polars-plan/src/dsl/mod.rs:602-615 | crates/polars-plan/src/dsl/mod.rs:1795-1807 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/mod.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfceb1da91b8cc26819e4a4eb9ad1393851b786c4dc5852519dce1e02d09bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-plan/src/plans/ir/unoptimized.rs:119-124 | crates/polars-plan/src/plans/ir/unoptimized.rs:131-136 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/unoptimized.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb7c2b27433072a1b56783d2cad7dc63a4eb54bdbe61777a9509fd61871d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-sql/src/window_frames.rs:541-549 | crates/polars-sql/src/window_frames.rs:552-563 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/window_frames.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"060ea83bba62c76a98e08f2b7c682aef2ac9306b6949330ffe90048463540313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): py-polars/src/polars/expr/expr.py:2967-3100 | py-polars/src/polars/functions/lazy.py:1932-2017 \u2014 These two members are one piece of code written twice and then edited apart: 86 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb5126c401c1d9e091e531dedcc8ab8b1b60156f8ad537841d3d00b0ddb2f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/polars-compute/src/float_sum.rs:295-302 | crates/polars-compute/src/float_sum.rs:307-314 | crates/polars-compute/src/sum.rs:181-188 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/float_sum.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b10f9fdab8d44510c70e4a3dc0c1ce8d29b92e297f089dbe6f49cc6f3fcbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-python/src/conversion/mod.rs:1144-1155 | crates/polars-python/src/conversion/mod.rs:1948-1959 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"85689933e27b0276c72a7eb1c4c8f91608ab068bc5d6b4c6c779317d007db800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-python/src/conversion/mod.rs:1162-1176 | crates/polars-python/src/conversion/mod.rs:1366-1377 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31a21ce0586e1e7b064ac1e391991820b950383bfaf00c39fa523b36c752a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-core/src/chunked_array/builder/list/binary.rs:10-20 | crates/polars-core/src/chunked_array/builder/list/boolean.rs:10-20 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/builder/list/binary.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"035ea6f72052ad8942687c7dad3612bd1059bb37c15b75fc99285c421258724f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-expr/src/dispatch/strings.rs:432-441 | crates/polars-expr/src/dispatch/strings.rs:451-460 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c300c321fd9a2f3c64573dc87f15220395633907a5d1eaa1754c48f04f31f896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-expr/src/groups/binview.rs:31-42 | crates/polars-expr/src/groups/row_encoded.rs:23-32 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a85c74700c676c0c6a63ce945af41da75ac6703195c26d3bbc2eb63a0a1f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/polars-plan/src/dsl/options/sink.rs:426-444 | crates/polars-plan/src/plans/options.rs:483-499 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/sink.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3bfc9296696315ca71ea9be260fcd2e38e5c294319e304822a5f68d302c341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-stream/src/nodes/dynamic_slice.rs:28-35 | crates/polars-stream/src/nodes/repeat.rs:27-34 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_slice.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ff8153d9a4856339271ccf47137d882b6ae9c947dd97120db96d1c196ab91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:813-822 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:888-899 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"1962d167d2ffca28fa2a5a762059d00a15728bb5b68767aa32e528d66c05826e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (145 corresponding lines): py-polars/src/polars/dataframe/frame.py:12947-13091 | py-polars/src/polars/dataframe/frame.py:13343-13488 \u2014 These two members are one piece of code written twice and then edited apart: 145 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":12947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020e718c68609085afe158d0575b73fb694042f249b6d17d7bf133fd62d7468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/polars-expr/src/reduce/first_last.rs:365-376 | crates/polars-expr/src/reduce/first_last_nonnull.rs:331-342 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2d98559a33fa4679e7d64e3579c8c0f13ebb666d91024805c7e00e662cf659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:74-81 | crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:61-67 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"52969ae1d372b7851f331f5317170ffcf298cc5d72d4d90414373c1ec0b20b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/polars-core/src/frame/group_by/aggregations/boolean.rs:11-19 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:201-208 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:241-247 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/boolean.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c952c7b471157dc17c395a522e2af1e4097cfa4695050651cce75abcc3903107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/polars-mem-engine/src/executors/filter.rs:155-165 | crates/polars-mem-engine/src/executors/group_by.rs:118-131 | crates/polars-mem-engine/src/executors/group_by_dynamic.rs:92-102 | crates/polars-mem-engine/src/executors/group_by_rolling.rs:124-134 | crates/polars-mem-engine/src/executors/stack.rs:109-119 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/filter.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f02414327b6be800c86950d1898578ae3f86e42a4cd4bd2a4acb3420eada6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): crates/polars-mem-engine/src/lib.rs:16-16 | crates/polars-ops/src/lib.rs:16-16 | crates/polars-plan/src/lib.rs:22-22 | crates/polars-sql/src/lib.rs:44-44 | crates/polars-stream/src/lib.rs:56-56 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/lib.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b283da430cea05a427300163e85819ba6490845094dc6ba1c079e2542d437659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): py-polars/src/polars/dataframe/frame.py:6309-6398 | py-polars/src/polars/lazyframe/frame.py:1685-1768 \u2014 These two members are one piece of code written twice and then edited apart: 84 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":6309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feacedba6edbd9bc0db081b87719aff6b049ea9ae2490741104a4659126def9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 71\u002B corresponding lines): py-polars/src/polars/functions/range/date_range.py:63-183 | py-polars/src/polars/functions/range/datetime_range.py:71-226 | py-polars/src/polars/functions/range/datetime_range.py:278-370 | py-polars/src/polars/functions/range/linear_space.py:241-311 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 71 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or 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":"py-polars/src/polars/functions/range/date_range.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d327700a4bf8ffbe35b5725f9df185729864c77842f9db9e3106314635a2c1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 72\u002B corresponding lines): py-polars/src/polars/functions/range/date_range.py:227-303 | py-polars/src/polars/functions/range/int_range.py:277-348 | py-polars/src/polars/functions/range/linear_space.py:69-193 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 72 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/date_range.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de8a656439ee6e134c3e8e29184e86ad254e72b39a381bc1fd6a747c06aff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/polars-compute/src/cast/binary_to.rs:148-157 | crates/polars-compute/src/cast/binview_to.rs:24-30 | crates/polars-compute/src/cast/utf8_to.rs:23-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/binary_to.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"712173c68c9506225ef314f2181eb054f9636a1ad7308e55f014a6c556d641c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-lazy/src/frame/mod.rs:534-544 | crates/polars-plan/src/dsl/plan.rs:293-306 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b66609aa3e339574f01c44b78ad36ad7b10529fc6d23c4e65da1d363170fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/polars-sql/src/context.rs:9110-9120 | crates/polars-sql/src/sql_expr.rs:810-823 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":9110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80991e1ec95d214f81229868edd7b465d4c2d32ed394aa71094f95dc5e3f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-compute/src/cast/binary_to.rs:132-139 | crates/polars-compute/src/cast/binview_to.rs:93-100 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/binary_to.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b2442e0f8d3db5a94feb151169d95a76fc3ede58ea6b3d6610ef243e47cb26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/polars-compute/src/cast/binary_to.rs:162-165 | crates/polars-compute/src/cast/primitive_to.rs:342-345 | crates/polars-compute/src/cast/utf8_to.rs:11-14 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/binary_to.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"209627b12c18cbfd57122b4b84195128cb6f9d59d2b8a4cefff246efbfa679ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-python/src/testing/frame.rs:21-33 | crates/polars-python/src/testing/series.rs:20-32 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/testing/frame.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef00164d93a90e744bf0dd014e558083c0f5d926fc4494311b18c5680c56927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-plan/src/plans/optimizer/join_predicate_fusion.rs:46-53 | crates/polars-plan/src/plans/optimizer/join_utils.rs:26-30 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_predicate_fusion.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a87ac9d13fb7d08b8bb42f978e3ef61edf7466d85b0a03d6badd404ca8641a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/datatypes/extension/generic.rs:57-66 | crates/polars-python/src/extension.rs:92-101 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/extension/generic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8cde3a3d4f2754a0d9a1cfbcbd5f8d2624032bb24755820c679e5bd08869d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-plan/src/plans/aexpr/canonical.rs:242-249 | crates/polars-plan/src/plans/ir/canonical.rs:210-219 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/canonical.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ab610989812fd9659ec84628a5b9663c8db281cf2e03505bc524c66055631d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-compute/src/binview_index_map.rs:260-267 | crates/polars-utils/src/idx_map/bytes_idx_map.rs:118-121 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe5a2edf97323c9bf41a3605b2215c247d81ba86d723ca55ae29a887979f6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-core/src/datatypes/extension/generic.rs:38-44 | crates/polars-python/src/extension.rs:73-79 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/extension/generic.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebbf61591ecb7bc8b7e57d018014a05257179342bb1fcab3b824d5f5d1ac5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-compute/src/binview_index_map.rs:274-277 | crates/polars-utils/src/idx_map/bytes_idx_map.rs:128-131 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"851fd0ed986c5e102425904271e34dd20b23b5bf3ccefeb6cfe1f08f762ca447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-ops/src/chunked_array/binary/slice.rs:7-14 | crates/polars-ops/src/chunked_array/strings/substring.rs:124-131 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c9b3ef2215b73c7352b8c4c045392e247a4d8c22cc96c11e23f40c9f16e636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-ops/src/chunked_array/binary/slice.rs:30-37 | crates/polars-ops/src/chunked_array/strings/substring.rs:141-148 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1f6917f2da2c453deb4f02bccc88c08a124d786d8b996b0a76f262e6f84f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/polars-plan/src/dsl/function_expr/map.rs:16-28 | crates/polars-plan/src/plans/aexpr/function_expr/map.rs:76-88 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/map.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166bb8340278d15d5c881137feabf44b3c00fed35e8c6e1969ad2d465dd6d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:36-42 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:34-40 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b681c4c958e51a804438513bc02db8f3d1bc03df750df9a409474ecdceb3213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-io/src/configs.rs:4-9 | crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs:86-92 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/configs.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e83c3f630a53f2eb05409f44231dcd364b7ced211b53856f391e8e97215c2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-plan/src/plans/optimizer/join_order/cluster.rs:397-402 | crates/polars-plan/src/plans/optimizer/join_predicate_fusion.rs:56-63 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f54a1af59c44b6fcca74b9a4021cfc66ba5d8f33a32af22402622976462218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/polars-core/src/utils/mod.rs:910-917 | crates/polars-stream/src/nodes/sort/sample.rs:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd924c40a001facc1d22176947e88839b0047f460882c1ea8ac30d9ee274f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-expr/src/hot_groups/binview.rs:92-99 | crates/polars-expr/src/hot_groups/single_key.rs:53-58 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/binview.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6484843bdc03ce7693cc47fb3583d34b2d90c6b30eef63d4f810755049b10a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-expr/src/reduce/first_last.rs:390-394 | crates/polars-expr/src/reduce/first_last_nonnull.rs:356-360 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490817f709db46f091b45daaf5453fddea05e42d0e2f9786c4db817792ae280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-lazy/src/scan/csv.rs:481-491 | crates/polars-lazy/src/scan/file_list_reader.rs: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":"crates/polars-lazy/src/scan/csv.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa34fa58ca1f2870726be3f284cd12199a5cb22c8df61fb005947140af3be841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-compute/src/nan.rs:16-22 | crates/polars-io/src/csv/read/field_index.rs:63-69 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/nan.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"64210b02c6838046e0432dba2f71ce54e3c8abf99da5f8d0847ed24085762e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/polars-core/src/datatypes/dtype.rs:1019-1028 | crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:35-49 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a59bcb4bf4c7726309806d5295171437bdda3bfd2752d80179c00b987e01610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-expr/src/dispatch/array.rs:110-116 | crates/polars-plan/src/plans/aexpr/function_expr/array.rs:185-191 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/array.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d73187a3ef9494722d9f1171fa153459e90f8b623bf2c9593a99b9c29f7049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-expr/src/dispatch/list.rs:382-386 | crates/polars-expr/src/dispatch/strings.rs:877-884 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/list.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bf85971f6d709b8aab033f942b7e53cdcb88e652d58f1a763c78aca4fb7962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-expr/src/dispatch/list.rs:389-395 | crates/polars-plan/src/plans/aexpr/function_expr/list.rs:224-230 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/list.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40a4ccfbd69030b8dd28525c83d5dffd9a0929bd0ba07b7f4a67a6f1d294b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-expr/src/reduce/first_last_nonnull.rs:241-248 | crates/polars-expr/src/reduce/min_max.rs:355-359 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last_nonnull.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6b7473a5faeb60215b79edf7ddac6a8ede57404f6fa1e68623c7afb854b752"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): py-polars/src/polars/expr/categorical.py:123-177 | py-polars/src/polars/expr/string.py:868-906 \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":"py-polars/src/polars/expr/categorical.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"15059501800af425f38ef108f2dceb7ec72594866d15677439e572daaab0e98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): py-polars/src/polars/expr/categorical.py:180-232 | py-polars/src/polars/expr/string.py:1660-1749 \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":"py-polars/src/polars/expr/categorical.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"476cfec6856a4f8b6cf2ba523a86052252df88e0bf05d0135e335e6cc2fd5c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-arrow/src/array/binview/mod.rs:479-485 | crates/polars-core/src/chunked_array/object/mod.rs:152-157 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd6d36ca82058ed07eea5b561065b64a4c2a04f7bfe995673945af031114b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): py-polars/src/polars/expr/array.py:1074-1168 | py-polars/src/polars/expr/list.py:1326-1393 \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":"py-polars/src/polars/expr/array.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f913fb5166ca5f2819e7e5cd9e9a5d4c55abc38a6f32553faae818108ca4ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-ops/src/chunked_array/strings/literal_chain.rs:57-63 | crates/polars-ops/src/chunked_array/strings/namespace.rs:93-99 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/literal_chain.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91df048dbfbcec8b4c2bd43f52079722d4fbe4781ee5e3587becf55a2d4a4de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-python/src/functions/aggregation.rs:37-41 | crates/polars-python/src/functions/lazy.rs:409-413 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/aggregation.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d231157e15f91a3a69f16261b7c888fe966fe256278eb5f6a48cd3526e6503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-python/src/functions/business.rs:11-16 | crates/polars-python/src/functions/range.rs:15-20 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/business.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adb67ac03e0b0709a359998f07778003d68a128ef103e6ab53cfe0b1d601274"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/polars-arrow/src/array/dictionary/iterator.rs:28-35 | crates/polars-arrow/src/array/iterator.rs:61-68 | crates/polars-arrow/src/array/map/iterator.rs:29-38 | crates/polars-arrow/src/bitmap/iterator.rs:529-536 | crates/polars-buffer/src/buffer.rs:509-516 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/buffer.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef90ee501b27a769ec2c92ba306cbd6d31198510945d620979450e8da85c7a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/boolean.rs:24-27 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:252-255 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/boolean.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b88e5f29fa6559762c94866fc726e93f935592f833acdba08b45d200df82daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/mod.rs:261-264 | crates/polars-core/src/frame/group_by/aggregations/string.rs:14-17 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"de807ff7fce9cacba7f93046f992322ad3bae551934bf60ab4bc46e1f84cc783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-python/src/error.rs:160-167 | pyo3-polars/pyo3-polars/src/error.rs:61-67 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/error.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2f88220c36db9eebeee97a7e40cd3ee8b803ac845124e8a80e30ec233fafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): py-polars/src/polars/expr/datetime.py:1942-2042 | py-polars/src/polars/expr/string.py:111-187 \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":"py-polars/src/polars/expr/datetime.py"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6feee1a16fb8b64841b0ddfc1a7e72adb49bdaee61fbd57bff6b645578e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-arrow/src/array/binview/mod.rs:718-721 | crates/polars-core/src/chunked_array/object/mod.rs:199-202 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2caec0394c50a424cdab80cdbeb96e5ab526f92e413442d5aeb5e22104a355e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/polars-arrow/src/array/list/mutable.rs:69-76 | crates/polars-utils/src/idx_vec.rs:232-238 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/idx_vec.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40a8d0ddf4a17de362f7a4193a8e7a9fe23261aebf82452a89cb98eefe69a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-expr/src/reduce/mean.rs:235-238 | crates/polars-expr/src/reduce/var_std.rs:170-173 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mean.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b12615fc7c92fead0e43bc5030830348b18e17798b82a4bbde1a45a36ca7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-sql/src/catalog.rs:469-472 | crates/polars-sql/src/time_travel.rs:76-79 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5b410bfc2cf5ff3e9bf7b7a574ee7fd85d7adcead7bd87cdfca8685aa5e304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-stream/src/nodes/sort/mod.rs:490-493 | crates/polars-stream/src/nodes/window/flush.rs:242-245 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42aa61b82afeab44250c46e6de0f48e8efc97cceb91f56edb5d1f350ce9b0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/polars-core/src/frame/column/mod.rs:1574-1579 | crates/polars-core/src/series/series_trait.rs:441-446 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/mod.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c6642a2f4c3178d935168c07b3b7068ce040026b1ba2eec6b60352364a57cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/polars-plan/src/plans/aexpr/function_expr/array.rs:46-54 | crates/polars-plan/src/plans/aexpr/function_expr/list.rs:62-70 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/array.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532bc9c2e44b07707dfe179bbe9048aaafbbd7ef959c5bcf641a4b62bd6a081"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-arrow/src/array/binview/mod.rs:713-716 | crates/polars-core/src/chunked_array/object/mod.rs:194-197 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"187f2b15ebfcecb6dfe43da6e1f48db735fa65e510ff9c6becb032c44cf6c35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/polars-arrow/src/array/dictionary/iterator.rs:47-54 | crates/polars-arrow/src/array/iterator.rs:90-97 | crates/polars-arrow/src/array/map/iterator.rs:50-59 | crates/polars-arrow/src/bitmap/iterator.rs:558-565 | crates/polars-buffer/src/buffer.rs:538-545 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/buffer.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7215e2649cae96738cc279905b51310d60cee7b994cce6318ffd2734374f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-compute/src/binview_index_map.rs:81-84 | crates/polars-utils/src/idx_map/bytes_idx_map.rs:69-72 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfa26a20b8d93dea0cbcad61abceb4115cb5a5528dfd95e1c20b7453662b5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-core/src/frame/group_by/aggregations/mod.rs:215-218 | crates/polars-core/src/frame/group_by/aggregations/string.rs:6-9 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22a7090585b1ddf806d6459b922cff2b5c9d17925987065bcc4cc3f1c076cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-expr/src/expressions/column.rs:120-123 | crates/polars-expr/src/expressions/element.rs:34-37 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/column.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bccbd74880ef6cae2cde8dbba277f716a227e5bb2e445b076c4d8e1a8c6778d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-core/src/chunked_array/builder/boolean.rs:22-25 | crates/polars-core/src/chunked_array/builder/primitive.rs:28-31 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/builder/boolean.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed4ef8c1e6eb9ce3e7b6c665ebe64372fc5cfaa5b4dbe462e030b294fbdd81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/polars-compute/src/rolling/moment.rs:261-265 | crates/polars-compute/src/rolling/sum.rs:124-128 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/moment.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d6eecbbbc6ab322258f019d515cc4cfb7ecf2ea1421475367e612ab04f70eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/polars-compute/src/rolling/no_nulls/min_max.rs:14-21 | crates/polars-compute/src/rolling/no_nulls/mod.rs:159-161 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/min_max.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"080bfe37073293d358b44f4fda79312d5ce3fe4574bd865568534b2c10977d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:211-214 | crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:268-271 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:299-302 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f23d0e28bf1fef9d72c859066ea714bb2eadc8da7d5519b0edeea39955ba18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-parquet/src/parquet/write/indexes/write.rs:27-31 | crates/polars-parquet/src/parquet/write/page.rs:250-253 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/indexes/write.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"529bddb84667bd4db02536f3dbcbe15561e750ec52bc67af846fbe5b2aa594ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/polars-stream/src/nodes/group_by/tuning.rs:134-137 | crates/polars-stream/src/nodes/joins/tuning.rs:105-108 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/tuning.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b400bcf070c9124b610f0af5628a9c71db0a9af29702eb3cbc684a6e1f29c61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/polars-core/src/frame/group_by/mod.rs:214-217 | crates/polars-plan/src/dsl/struct_.rs:86-88 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/mod.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f2c26edc8318474f042ad1fbb4e68d204e202c51ce90e0f01173f729bdb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (97 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:420-516 | crates/polars-io/src/csv/read/streaming.rs:557-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.rs:420\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a8549a14d112696a08c0730e8313a9ae76cb0865e5bef70f9dfa7046f02645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (89 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:110-198 | crates/polars-io/src/csv/read/streaming.rs:295-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.rs:110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ac3bcdd2545ba86965ffeb2e084845bb1a12aedcb1e02466ab81468c0ddb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:617-693 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:606-682 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:614\u0060 calls \u0060hash\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:605\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfe8d26a1c09984bf613a8271ed4d25fa1e1126fb0d2f744ecdce6acc5a07ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:747-819 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:735-807 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b8630898ca2f2b20c77ca9e5c4e6e3244217bd6b4eacdf2256e1efd3ba5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70\u201371 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:711-780 | crates/polars-stream/src/nodes/io_sources/parquet/init.rs:382-452 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:711\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68eb44bcade047715e07e1c7a2c57175fbce32946f410b374b1a186ab88c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/strings.rs:184-249 | crates/polars-plan/src/plans/aexpr/function_expr/strings.rs:366-431 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/strings.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/strings.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/strings.rs:184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01d6533c8a25a0521d34a5db7ddf6a5300fa0abda2f45fbf06807933ef057e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/datetime.rs:87-148 | crates/polars-plan/src/plans/aexpr/function_expr/datetime.rs:218-279 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/datetime.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/datetime.rs\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/datetime.rs:87\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/datetime.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d1d2560f61097fa787f8497d84f24a53526e919a6ab65595ce77da0b95c086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201360 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:543-601 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:529-588 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:528\u0060 calls \u0060Fused\u0060, \u0060hash\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:542\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"be74401fa11512a9d7da50a8b34a62e741f7231ca12859153e17b72153092590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:858-909 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:879-930 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:858\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c90d3138e38fe75c37796ee7c603e72fad7a62f910b6dcdefa57a123940e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/csv/mod.rs:176-224 | crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs:382-430 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/csv/mod.rs:176\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"23432c11f8197a8e46300f5bb669ddf13373a33cd55a4999aa0b8356804224bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/list.rs:65-108 | crates/polars-plan/src/plans/aexpr/function_expr/list.rs:240-283 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/list.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/list.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/list.rs:65\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/list.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee3ea5ca966aac33348e4a855c73f40f1de35df9ef38d39f0395d393a93f72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:933-975 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:953-995 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c8b0c918f5517c85591e5ad820e37d0fd81f3a053f3c0fde58cb50dc0aeb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/traverse.rs:312-354 | crates/polars-plan/src/plans/aexpr/traverse.rs:424-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96e2e340d997d73f6b1109eb98667ef6b369339f25c3616ea1946a5f2f622c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/traverse.rs:379-421 | crates/polars-plan/src/plans/aexpr/traverse.rs:494-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:379\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f83e037c85c23e513502f22d16a88510c40bda478fdd05460db053c176a79df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/boolean.rs:61-101 | crates/polars-plan/src/plans/aexpr/function_expr/boolean.rs:128-168 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/boolean.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/boolean.rs\u0060 as WHOLE FILES: 89% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/boolean.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":"crates/polars-plan/src/dsl/function_expr/boolean.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"78749743b39939773a4ca068ed93a9dfdbf2fb99e6bbf524c3ecf5c31dec3aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:502-542 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:486-526 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:502\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:528\u0060 calls \u0060Fused\u0060, \u0060hash\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:544\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b414bb693b45833c6c74288f25da2fb64b76c14572fbe906d777058a242d07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/polars-core/src/frame/row/av_buffer.rs:224-263 | crates/polars-core/src/frame/row/av_buffer.rs:700-739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/row/av_buffer.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":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac836080d203dc0bf0be57dbaeef59260d68dc1b2e04b722eb5d942f927a453e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201340 lines \u00D7 2): crates/polars-time/src/windows/group_by.rs:712-746 | crates/polars-time/src/windows/group_by.rs:748-787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/windows/group_by.rs:748\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d59afdef33efd9f275d983a1ec9ada52c17af84643375d6442975e317f1dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:1191-1229 | crates/polars-stream/src/physical_plan/to_graph.rs:2067-2105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1191\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dbbbeeeb29f1cb72a5e21243a8f438dddc0eb6fffd02fafb64df937c2a1635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1022-1059 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1169-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1022\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4810489ea466374fedd411d1d5d5438408dcdfe15081282a946d34ab49fbd7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:680-714 | crates/polars-io/src/csv/read/streaming.rs:735-769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.rs:680\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0478c7a35ce4020d3d9c507694f4e46a36e0d54acf53dd1bbbb0d9ee7caa5192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/polars-io/src/csv/read/parser.rs:484-517 | crates/polars-io/src/csv/read/parser.rs:627-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/parser.rs:484\u0060 it does not close everything it opens, so those exact 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: \u0060crates/polars-io/src/csv/read/parser.rs:484\u0060 is reached only past a guard at line 477 that tests \u0060self.v\u0060 and leaves the function early, and \u0060crates/polars-io/src/csv/read/parser.rs:627\u0060 reads \u0060self.v\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06a5b3d01a40ac2cf5cb9864c389cfce9f50758e1b7ede90adf4b40deb76e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:217-250 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:340-373 \u2014 before extracting anything, compare \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c3e27a4b8b0e011b7aa17cd16e77d68e66a26ce8d7f4c4b6868242811f03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:977-1010 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:999-1032 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:1011\u0060 calls \u0060Sql\u0060, \u0060fmt\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1033\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90861d67d376a359c9a1722ce9497afe8d5f53e7cfbe81a25c3b03a04171048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/transform.rs:99-132 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/transform.rs:170-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/transform.rs:99\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/transform.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"128af7912dcf62a20831581d987ecefd45280ab709f13c7e89421b24dc150a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/polars-expr/src/dispatch/array.rs:201-233 | crates/polars-plan/src/plans/aexpr/function_expr/array.rs:253-285 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/array.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa34cb754ec60129e24b7f9eefa5dbb1888a010ed2babd0ce81263a3a26d82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:1024-1055 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1045-1077 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb7fa3da2eebbec178346c8bce0c68f3979047910fb7feb784d99ac5d8fa77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/polars-core/src/chunked_array/comparison/mod.rs:661-691 | crates/polars-core/src/chunked_array/comparison/mod.rs:693-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e07c03513c78c9b8d20b4adc4a9818f651543dee37731b6679e9e9f196a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:60-90 | crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:125-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/agg_list.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"08543b9e97f023ddb105fc78f687aaa111be90dc335eecb61f6e749c7ac91d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:659-689 | crates/polars-parquet/src/arrow/write/mod.rs:1039-1069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:659\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fc958308e1bf0eb244601661613b1066f15f71a820731449885eb00366359e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:703-733 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:694-724 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:734\u0060 calls \u0060Sql\u0060, \u0060hash\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:725\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4ebfa10ebbc5d43cfb8cc8d2092f6ba30c082137abf1668090ec2d28ed6422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201330 lines \u00D7 2): crates/polars-compute/src/decimal.rs:420-449 | crates/polars-compute/src/decimal.rs:452-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c488c99ff2b00634ac8398c7d8033bfa3c12c487a9c650dfa937a9a05359e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1184-1213 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1280-1309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1279\u0060 calls \u0060temporal_range_output_type\u0060, \u0060clone\u0060 and \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1183\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f2dc8e7c16684d19b27c17af8b96e5b18e72a7afc25bc26576a143e3789b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/traverse.rs:118-171 | crates/polars-plan/src/plans/aexpr/traverse.rs:239-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9116d1518ef8c51a77190624e704ab791f160894dfc4ccc3f426914984f4320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:894-921 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1306-1333 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea2fa5f8e9767c2e833c42570d6130c7a9cb85d0199e56c6ae8c674ca7dc60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/rolling_window.rs:110-136 | crates/polars-core/src/chunked_array/ops/rolling_window.rs:177-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ops/rolling_window.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/rolling_window.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ff9b1125323c5677c946637e1d47a8c324ffff66e5d11e032823a76c8abd39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs:155-181 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs:197-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs:155\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd8dc7657dc98209f8ed7df9afa6fe0df335286125dd5c91c50125ef517cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:47-73 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/morsel_serializer.rs:46-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:47\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb051f11f5e611cf78cfeff4ee1816fe0079e38799122eea4c00341f36b6abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/polars-core/src/chunked_array/comparison/mod.rs:905-930 | crates/polars-core/src/chunked_array/comparison/mod.rs:932-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb0bf087d55fd33b0e56e3d4a398e563e8c4f0e047b88b72eb110fdf4800bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/polars-core/src/frame/row/av_buffer.rs:170-195 | crates/polars-core/src/frame/row/av_buffer.rs:675-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/row/av_buffer.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a54b0abee566e43862ba27cc69edf78ef77a9c605190746875051e9ea3de68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/polars-expr/src/reduce/convert.rs:238-263 | crates/polars-expr/src/reduce/convert.rs:271-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/convert.rs:238\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/convert.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e74be10941c27d0d4d8c1fa4b4d5edea255d503e609413510ecd8f38848c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/rolling.rs:32-57 | crates/polars-plan/src/plans/aexpr/function_expr/rolling.rs:31-56 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/rolling.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/rolling.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/rolling.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":"crates/polars-plan/src/dsl/function_expr/rolling.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8bb8e64a8915a90fdfb91bfa2169866cc95a8221d945c7d80062b41f5bc82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:793-818 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1207-1232 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee6cd15538b30527b2bd9631de69f3fd022255ad044ab1839b05a750d64f8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): docs/source/src/rust/user-guide/concepts/expressions.rs:53-77 | docs/source/src/rust/user-guide/getting-started.rs:82-107 \u2014 before extracting anything, compare \u0060docs/source/src/rust/user-guide/concepts/expressions.rs\u0060 and \u0060docs/source/src/rust/user-guide/getting-started.rs\u0060 as WHOLE FILES: this scan already matched 5 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/concepts/expressions.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/concepts/expressions.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"271ed599deeafba04730daaffdeeb7e248a2b244d84ff22d5fae406251d2b86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/polars-expr/src/groups/binview.rs:220-244 | crates/polars-expr/src/groups/binview.rs:263-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/groups/binview.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1026d5fc8ab9f23402eb47e51b6db5a73353b1101e2965527a1ae14c76eb6ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/polars-io/src/csv/read/schema_inference.rs:350-374 | crates/polars-io/src/csv/read/schema_inference.rs:403-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/schema_inference.rs:350\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"384637ad7089945101b80fc9f893198c49f0ead2a53f0a10aa85442b790b0364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/polars-parquet/src/arrow/write/binary/nested.rs:24-48 | crates/polars-parquet/src/arrow/write/binview/nested.rs:20-44 \u2014 \u0060crates/polars-parquet/src/arrow/write/binary/nested.rs\u0060 and \u0060crates/polars-parquet/src/arrow/write/binview/nested.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 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/nested.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f0904d6e54a6aee2e70643d0d6621f646e2b8558d4e591baeb9799b6e456ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:732-756 | crates/polars-parquet/src/arrow/write/mod.rs:952-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:732\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1419f966e8b9b5c0dee194ab6b4977f475f4522b139ad65d7431ca6a183cdf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:1058-1082 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1079-1103 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e49354c8768232cdcd33dcb9bd882bab54233a8f6fb84005de0ee1a54072a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/filter_constraint.rs:898-922 | crates/polars-plan/src/plans/aexpr/filter_constraint.rs:1110-1133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/filter_constraint.rs:898\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"702beb822522982dda363d4e17589c0c30fb66aec770bfac7045090d42872671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/polars-io/src/csv/read/parser.rs:578-601 | crates/polars-io/src/csv/read/parser.rs:914-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/parser.rs:578\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"959f3e2e89d9e9533b73bd037b10690c957197385e47f09d4178e5392590cc23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:65-88 | crates/polars-io/src/csv/read/streaming.rs:249-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.rs:65\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"881431411778225d5e7ffd50dd1149709389222886c173221d346889b16160dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/polars-parquet/src/arrow/write/binary/basic.rs:123-146 | crates/polars-parquet/src/arrow/write/binview/basic.rs:118-141 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/binary/basic.rs:123\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"515f803dc80911ac1dd190b04a306551f8ae6cb809814d5b27d710be3da7a678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:634-657 | crates/polars-parquet/src/arrow/write/mod.rs:1014-1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"277379c7fa25cecb1b0abaae84b208c8612c5e9078a59bfac862b59eebf43b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:830-853 | crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:870-893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:830\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"967180aec9c05aa90c31c521a208462bf0896d938eaaae7d3cd9373e03f55e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:114-136 | crates/polars-stream/src/nodes/io_sources/parquet/mod.rs:151-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/ipc/mod.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"936f97607307e4b69a5954a586b7ff0be89f6237009dfbc1677ea8847defbb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:405-427 | crates/polars-core/src/series/arithmetic/list.rs:419-441 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:405\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f459a1a97bda396f392719018981124f70a45407583b887542c4efa7b6caf62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/polars-expr/src/dispatch/range/linear_space.rs:137-159 | crates/polars-expr/src/dispatch/range/linear_space.rs:175-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 \u0060crates/polars-expr/src/dispatch/range/linear_space.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1234924038f82ec0d78a4d33c9d583aabcf222ed70985cbd80e4bde06e303519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/polars-expr/src/dispatch/strings.rs:681-701 | crates/polars-expr/src/dispatch/strings.rs:735-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/strings.rs:681\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0e59a71416f52aa124f13d3eddc872316b32593ec545f3b288826a4748fc0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): crates/polars-ops/src/series/ops/replace.rs:78-100 | crates/polars-ops/src/series/ops/replace.rs:137-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/replace.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5baa7fa8461efd702cb1881113519112eb2426d2ee6cd47a8c9daa35bcff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs:137-159 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs:109-131 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f894407fb10a721dfeb8c28d0504c50197b5c1544d8916b7daf2cb000d9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:980-1002 | crates/polars-stream/src/physical_plan/lower_expr.rs:1076-1098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:980\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74c4cf4db2860f19674887ec89c89b774c1a397a950cea74ef190222aaa8084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:195-216 | crates/polars-expr/src/dispatch/groups_dispatch.rs:230-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d2cdc5ad9885b69f0fa936c91490cf1f58686b6fbed4483585213e31d8076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-expr/src/idx_table/binview.rs:88-109 | crates/polars-expr/src/idx_table/single_key.rs:138-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/idx_table/binview.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed013bca14d66646794bcc3c9f649acce5536a0f6c8a12fa6ab8a161ad14e728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201322 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs:73-94 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs:33-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 \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"118d9634f90e738df31f1cdc033f38e64ffb5d9dc8ca481ec795fcf6a37eaea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:653-674 | crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:841-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:653\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"20202495f999f3b332ab9bc24a0afab63bba1accd2d4f7e98c64f48fe91a8f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/polars-parquet/src/arrow/write/binary/basic.rs:90-111 | crates/polars-parquet/src/arrow/write/binview/basic.rs:88-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/binary/basic.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8607fb637a2ca205a757345fd681671fbd7e78d928dce26eb536fb3ccd3a6523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-parquet/src/parquet/write/row_group.rs:123-144 | crates/polars-parquet/src/parquet/write/row_group.rs:189-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/write/row_group.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/row_group.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc1efc7e71d45baf6ad75c55b2dac2ce63f057b5aee7363d39b4caf71f48905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/binary.rs:35-56 | crates/polars-plan/src/plans/aexpr/function_expr/binary.rs:65-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/binary.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/binary.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c402b9f0436cc6b9e6970f3852da19a32af7357a9d99476492c9c29efe311b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:681-702 | crates/polars-plan/src/plans/aexpr/schema.rs:746-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:681\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0148d4128b1ebdb5add4a7380d520c847a0a07ac5b4d51eac59e4bc76cd3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 4): crates/polars-ops/src/chunked_array/array/join.rs:18-37 | crates/polars-ops/src/chunked_array/array/join.rs:61-80 | crates/polars-ops/src/chunked_array/list/namespace.rs:81-101 | crates/polars-ops/src/chunked_array/list/namespace.rs:120-140 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060separator\u0060 to \u0060\u0026str\u0060 in one and \u0060\u0026StringChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-ops/src/chunked_array/array/join.rs:82\u0060 calls \u0060append_null\u0060 and \u0060crates/polars-ops/src/chunked_array/array/join.rs:38\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/join.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"da792bf1f10d82940b0e038de8edd027df3382033cc686eb01ea6f976c5e333b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 3): crates/polars-time/src/windows/group_by.rs:629-645 | crates/polars-time/src/windows/group_by.rs:714-730 | crates/polars-time/src/windows/group_by.rs:750-770 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/windows/group_by.rs:629\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4987298a8a67d1b380e83a67684746490c0f878ee841bddbeb92dd877e89f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/polars-compute/src/moment.rs:369-389 | crates/polars-compute/src/moment.rs:518-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd5c18c1ef286ccb6a08884579ae7f268d3c0ce8f75bee5dcf2a1f19fd303ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:259-279 | crates/polars-expr/src/expressions/structeval.rs:79-98 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/expressions/apply.rs\u0060 and \u0060crates/polars-expr/src/expressions/structeval.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"484fe17b52c8fcd07bb39140832a6aa1016552274c923f6984002728d4a3e5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:249-269 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:276-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/simple.rs:249\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18533f7f01052de7eca7ca28569c48a933fc0bd5bfdb82296b4a6a824635fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/strings.rs:145-165 | crates/polars-plan/src/plans/aexpr/function_expr/strings.rs:333-353 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/strings.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/strings.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/strings.rs:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a799e94c6861888d3eded55e478295b67ea3da50227ce15f6fa376cecc21c4c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:324-344 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:365-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"98190be4487fcb6a4b09275dd67a5e87fa7ed7dba3834248affe78598264091f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/polars-plan/src/plans/to_description.rs:257-276 | crates/polars-stream/src/physical_plan/to_description.rs:690-709 | crates/polars-stream/src/physical_plan/to_description.rs:772-791 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/plans/to_description.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_description.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/to_description.rs:257\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34d41eaea40786d54bf61d91923299dee6456f8f22920ba72d4290cef29c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-compute/src/boolean.rs:49-68 | crates/polars-compute/src/boolean.rs:116-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/boolean.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":"crates/polars-compute/src/boolean.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b02813665594ffc9558daf4e3fbee316bbc6a457d41da001fe778eb97d91a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/polars-io/src/cloud/concurrency/admission.rs:103-122 | crates/polars-io/src/cloud/concurrency/admission.rs:330-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/cloud/concurrency/admission.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/admission.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d1a828034dfd4ebcc24f6e602b84acd7a21cea63d846085dc8cd4a312c03f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-io/src/cloud/options.rs:664-683 | crates/polars-io/src/cloud/options.rs:734-753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/cloud/options.rs:664\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a7b9c8834f36396a1c478255e25d8bbc1af8c450f26f15d5fecc98178a8d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/sets.rs:188-207 | crates/polars-ops/src/chunked_array/list/sets.rs:283-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/sets.rs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sets.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f582b694bf7416cb581d2d954a57d6d56d3f3fffccc56e3aa47d02d9b997eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-ops/src/series/ops/horizontal.rs:132-151 | crates/polars-ops/src/series/ops/horizontal.rs:158-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/horizontal.rs:132\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/horizontal.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c423a78c20ffabf3ea2e11cacde67d3e57ff532ab5a2eb426536780c9db51d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:483-502 | crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:515-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"95876f7a8ef681e700ae65e80963efbb1718fd31a46a61122ee1f2b1d04e8da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:911-930 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:931-950 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8fa306d2a3e72efe01def334f4c2009466e744e7ab15622e986d7c6f0ca86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/range.rs:123-142 | crates/polars-plan/src/plans/aexpr/function_expr/range.rs:202-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/range.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut fmt::Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/range.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a06e56c3bedae9048c0a48849829411ccff7abce9db7ace4a896696f44142b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs:232-251 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs:275-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs:272\u0060 calls \u0060deep_clone_ir\u0060, \u0060init_indexmap\u0060, \u0060Some\u0060 and \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs:232\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aac5054c649bc44849ed792a05482b2ca81fbdaa42b1c03019e055558ffe47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/sortedness.rs:316-335 | crates/polars-plan/src/plans/optimizer/sortedness.rs:356-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/sortedness.rs:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2732ffdd11cb6d258ddba9f780feb1d5619e2a0b7d56a3c0a76146fe6a13be29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs:59-78 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/io_writer.rs:44-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f598810b8f5d8c3abe96588f978157dbb66cda6b844cbc897376e8b496a4c90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs:61-80 | crates/polars-stream/src/nodes/io_sinks/writers/parquet/mod.rs:103-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.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":"crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d1df78e4d3a8ecad2291d0aa831a59d0a93ed887ca887b854a1a1b5cd2c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_group_by.rs:822-841 | crates/polars-stream/src/physical_plan/lower_group_by.rs:871-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_group_by.rs:822\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c05f19cf7699d6949458e8e2d5db77ceae7a51b16d518b1b4c507f967872e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-core/src/datatypes/_serde.rs:112-130 | crates/polars-core/src/datatypes/_serde.rs:176-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/datatypes/_serde.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060dt\u0060 to \u0060\u0026DataType\u0060 in one and \u0060SerializableDataType\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/_serde.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"811466a26cbfb3e999ba03e654b12d39e404b228550ede221120ebadcefd00cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/polars-core/src/frame/column/scalar.rs:250-268 | crates/polars-core/src/frame/column/scalar.rs:298-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/column/scalar.rs:250\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/column/scalar.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d156556cbbd8cceeca94315d20e7aea33152961bd1d30a15d4d51001b2000ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:807-825 | crates/polars-io/src/csv/read/streaming.rs:838-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.rs:807\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"60480cba870f3167e2bd85a6042e64af8f676e6dd8ddd5657eb655d0185b598e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/sets.rs:127-146 | crates/polars-ops/src/chunked_array/list/sets.rs:229-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/sets.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sets.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f04e1b80275811a25897c078b5df982f9fb781f380fbf0915a8d0e25bb6b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:145-163 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:173-191 \u2014 before extracting anything, compare \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb3d05b7cd7c4109e1dee2499a306a1ef865434d082f0f1cc84eca522a1e3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:778-796 | crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:881-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:778\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26e8c3accf0710204943c47b024975577dc9baa548b40f8f482127592c2e782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:597-614 | crates/polars-parquet/src/arrow/write/mod.rs:980-998 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:597\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c80999c182c4109b0b4a71afcf70bedd307a1d76e7a53f0dce1d3dc3b59330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:695-712 | crates/polars-parquet/src/arrow/write/mod.rs:918-936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:695\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcccedb3deb88c5f60b8b33a752cb6d8017a6d3aad7b69cc3f8411d840454f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs:241-259 | crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs:261-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f8eb1b01f6cb4d7b96c6e425cabc3b1299b5409f0230d6c00fac714a8d5557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/traverse.rs:51-68 | crates/polars-plan/src/plans/aexpr/traverse.rs:144-161 | crates/polars-plan/src/plans/aexpr/traverse.rs:265-282 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff7b9af50852ee15338ce1f86f5ff4aebc828507093e1338e5e31c6786330e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/polars-time/src/windows/group_by.rs:315-332 | crates/polars-time/src/windows/group_by.rs:372-388 | crates/polars-time/src/windows/group_by.rs:447-463 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/windows/group_by.rs:315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e2c376454c994ba328bc5539387db656729bf41cf9c2b6a630c5a2c2d587ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:512-529 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:693-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:512\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:511\u0060 calls \u0060clone\u0060, \u0060into_series\u0060, \u0060agg_last_non_null\u0060 and \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:692\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca6894ec5eaf1a0edc5ac9ef773bc22e9a50582d33aef6bb25e01bb7dea5caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:1163-1180 | crates/polars-core/src/frame/mod.rs:1195-1208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/mod.rs:1163\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0f7d42b3a75b2fd041e14b390a600061102bf391924244224f1407e2df69d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-core/src/series/arithmetic/list.rs:597-614 | crates/polars-core/src/series/arithmetic/list.rs:695-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/list.rs:597\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6e17f327942e886a524b5c3093a75fbd21678dbfc4f6f0366f0fdb3e088d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-core/src/series/from.rs:335-352 | crates/polars-core/src/series/from.rs:362-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/from.rs:335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"68641aa5c38355db1760c30514eb81120726dd5f1f43df5a11a28543fa6ec978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:40-57 | crates/polars-io/src/csv/read/streaming.rs:223-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa02e27f7c11bfb12fc2df0bba9a9a06b49cfc9d695232edc6a2dc4900f837d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/min_max.rs:100-117 | crates/polars-ops/src/chunked_array/list/min_max.rs:218-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/min_max.rs:100\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ff29a823b97e11c7f371157e03bf998b1d546e98e265e59869e2b3d46e8eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/namespace.rs:426-443 | crates/polars-ops/src/chunked_array/list/namespace.rs:500-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/namespace.rs:426\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96613d7f3cdb2e2cf3a896826797c3edd014759f75cb6f6bc73da5ca77ad89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/namespace.rs:632-649 | crates/polars-ops/src/chunked_array/strings/namespace.rs:673-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/namespace.rs:632\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e10d3b9260a2ddfe0561f2ef1847f0893149dc2e9c94e94ef33cc1fed0ed36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/split.rs:195-210 | crates/polars-ops/src/chunked_array/strings/split.rs:344-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 \u0060crates/polars-ops/src/chunked_array/strings/split.rs:195\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6629e156180f89a28a4ab2596267686822451c58c2a87287deec440dd48272c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:259-276 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:283-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da09444d23da42522d6f996d561f686c0cbd30123c625b21eee80e0213fcee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:296-312 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:453-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:296\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb9132fcee58634b5953f797479e3dfdc95d37cd8ac998d59dfdcbc89d8ef2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:781-798 | crates/polars-parquet/src/arrow/write/mod.rs:1081-1098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac0112668fe760a5afd3bfd45ee639c33b0548b109a0b8be154a0a0df7510e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/polars-plan/src/dsl/selector.rs:199-228 | crates/polars-plan/src/dsl/selector.rs:414-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":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a3f4e62d43335d851d74a0ce5288754327d0b272136065f4594a071860d881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs:408-425 | crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs:456-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs:408\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"057465e0e223ab81f4e968cc6a00a414b865f2ee22a5c6d93771325df1dee7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-sql/src/sql_expr.rs:2521-2538 | crates/polars-sql/src/sql_expr.rs:2594-2611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/sql_expr.rs:2521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fde27e11bcd8a5c5bd1affafc84d7133f93194306a711470ba2cb875edb1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-stream/src/nodes/backward_fill.rs:52-69 | crates/polars-stream/src/nodes/interpolate.rs:66-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/backward_fill.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4a401dcd6e15cda11dd8b6b47e0dac5a6e7531b27f67f724713a5f55c9ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:41-58 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:39-54 \u2014 \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6be5a7b3bf1c7b87c08695893791bf355a138f9da908e74169d2a384c1928f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:811-828 | crates/polars-stream/src/physical_plan/lower_expr.rs:871-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:811\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a33ac6b82505885909c2c304b3298cb756195acd33dc09f469f642311ff2db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:2382-2399 | crates/polars-stream/src/physical_plan/lower_expr.rs:2456-2473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:2382\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490d4b83029e5c0b282fddba6d3d2f9a0b9e44f088d2bed5df56dc023dcace4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/polars-stream/src/nodes/dynamic_group_by.rs:355-371 | crates/polars-stream/src/nodes/rolling_fixed_window.rs:204-220 | crates/polars-stream/src/nodes/rolling_group_by.rs:295-311 | crates/polars-stream/src/nodes/sorted_group_by.rs:180-196 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:355\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:352\u0060 calls \u0060clear\u0060 and \u0060crates/polars-stream/src/nodes/rolling_fixed_window.rs:200\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70b2705d77c1e82fd7319104b6cd53a3544a486ea75ad0b4853ef79199358d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:64-79 | crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:137-153 | crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:190-205 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/predicate.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aed15741e678999db879096886be4cf1707cc3541c11f4f77decdf23b0647cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-core/src/chunked_array/random.rs:88-104 | crates/polars-core/src/chunked_array/random.rs:142-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/random.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-core/src/chunked_array/random.rs:86\u0060 calls \u0060Ok\u0060, \u0060clear\u0060 and \u0060crates/polars-core/src/chunked_array/random.rs:141\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/random.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdbaf7d3afca059196c35cf6cb84c1f672fb91b0b53f065738fa2451e90610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-core/src/fmt.rs:676-692 | crates/polars-core/src/fmt.rs:697-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/fmt.rs:676\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df15d38eac998535ca40f0bf3b60b4c37466a51ff0e82debef72e5e8d1befc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:657-673 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:841-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:657\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f379f0f26a4f5c3449467ba2c393aff1866c05cd9c8c807e89ba0b9ff1e50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/polars-io/src/csv/read/streaming.rs:403-418 | crates/polars-io/src/csv/read/streaming.rs:539-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/streaming.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de26b8e05278018c11d4dc134bb45059432c8afbeef722cbbb3d893da763e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-mem-engine/src/executors/hconcat.rs:41-57 | crates/polars-mem-engine/src/executors/union.rs:91-107 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/hconcat.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/union.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/hconcat.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb30c302b3a875fa7f9517841e71fe83af25940c7f6385fa8543c7e23c5b368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:392-408 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:424-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/simple.rs:392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ed6c626c105edd80df7060760562b18f484f84940fac6018c56fa9befc6c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:538-554 | crates/polars-parquet/src/arrow/write/mod.rs:565-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed2288822dbc60d41c32c8c58fa9d742ceeb41367cb72fe1348ca7614fcc1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:834-850 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:821-837 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:834\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:820\u0060 calls \u0060hash\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/mod.rs:833\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba476d5c9fc05ec33aa962d6a24d24ddb305a374c060111c82d9643f3d227e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/traverse.rs:177-193 | crates/polars-plan/src/plans/aexpr/traverse.rs:294-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:177\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb5510843c9af8923f5e58b9532b26328b3685f193ac95c0c177f2f9d415cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-row/src/fixed/decimal.rs:189-206 | crates/polars-row/src/fixed/decimal.rs:224-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/fixed/decimal.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aac3685b3cabe2de1276e06fb2c41ce8366068cb60986999de8bfacca932f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:136-152 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:127-143 \u2014 \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.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":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4006a6703e44498d64190ce7a8d773f84281b71cb8be4d8b376384dc2448da37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-stream/src/nodes/sort/flush.rs:231-247 | crates/polars-stream/src/nodes/window/flush.rs:210-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/sort/flush.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/flush.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5251a38aa32aab5001d1bf50555670e01ef65222b34f2c323cec6b323ba45b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-stream/src/physical_plan/fmt.rs:847-863 | crates/polars-stream/src/physical_plan/fmt.rs:944-960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/fmt.rs:847\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9b4b68964efda7011abcf13d2bb5c5b76bc8aaaae136397c82ad33455c072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:1387-1403 | crates/polars-stream/src/physical_plan/to_graph.rs:1419-1435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1387\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacea8268ed35694a2ad6a7d84bfade708a32db7ea4bdbf7c4e42b687bdc7229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/polars-parquet/src/arrow/write/mod.rs:762-777 | crates/polars-parquet/src/arrow/write/mod.rs:786-801 | crates/polars-parquet/src/arrow/write/mod.rs:1086-1101 | crates/polars-parquet/src/arrow/write/mod.rs:1112-1127 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa230900dd48da3485c60262dd006bdd04231b5ac7134b7fbe1344cb09f9f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/polars-python/src/conversion/mod.rs:452-467 | crates/polars-python/src/conversion/mod.rs:501-516 | pyo3-polars/pyo3-polars/src/types.rs:528-543 | pyo3-polars/pyo3-polars/src/types.rs:578-593 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e6a18e1c6c9c9816e8d88f4fad1d2ea2b8d7f3bf3d6c006b105c1071cda63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/polars-arrow/src/array/boolean/mod.rs:416-431 | crates/polars-arrow/src/array/primitive/mod.rs:525-540 | crates/polars-core/src/chunked_array/object/mod.rs:238-252 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-arrow/src/array/boolean/mod.rs:416\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881a11e52bedb6e476dc83f1afe043af50943aed2990bb0250efb176f6df6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/polars-sql/src/context.rs:5049-5064 | crates/polars-sql/src/context.rs:5120-5135 | crates/polars-sql/src/context.rs:7365-7380 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:5049\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb0e744a20c6849968810648d68b31917bed0560a68bb01151e57688bfc9939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:127-142 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:609-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:127\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f829fddb80bc0d9767138991b1196f0a4683faa0b4427d79abec4f427f150ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:319-334 | crates/polars-expr/src/dispatch/groups_dispatch.rs:877-886 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"95595d683e7b77f82dfbd7c22027d2b2495002804fb566148d9a99c1295b581a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:612-626 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:794-809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:612\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab1f746996a1d2c90fa0819bdc9c73e244dd800d5fba88866da1f3914f2b04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-core/src/utils/mod.rs:253-268 | crates/polars-core/src/utils/mod.rs:275-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b4433bff820746d5a648cc8fcd5f9bcb726ff50a016052dca69467318d094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-expr/src/dispatch/pow.rs:55-70 | crates/polars-expr/src/dispatch/pow.rs:91-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/pow.rs:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/pow.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c53753731897a3e77cec44e4779a8c7d515430f093e10c13ec997568387575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-expr/src/expressions/eval.rs:223-238 | crates/polars-expr/src/expressions/eval.rs:406-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/eval.rs:223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c6fa990d5362e04ffa6c730cc5faffd5f1589ee9d976c7524c38d5400c566e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-io/src/parquet/read/read_impl.rs:223-238 | crates/polars-io/src/parquet/read/read_impl.rs:365-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/parquet/read/read_impl.rs:223\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/parquet/read/read_impl.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac6d4736fa91d99c1d0090b1fbe261be26ad7e4a3862f9b598be3de9808bc17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/polars-ops/src/series/ops/replace.rs:253-268 | crates/polars-ops/src/series/ops/replace.rs:295-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/replace.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"309f2a509b3b1eceef7ede908fe3e8805c6b4ff2a1a728edf9f4ce9c32164a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:367-382 | crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:416-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 \u0060crates/polars-parquet/src/arrow/read/deserialize/boolean.rs:367\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/boolean.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bcc7c7244fe3a03108065bad183e80c8f8809602b4f21e4a82fa3bd7226a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:41-57 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:48-64 \u2014 before extracting anything, compare \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.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":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c032f54ae8fe46882c6372a758e05f94dcd57ca79c539499f36d296298b49a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/polars-parquet/src/arrow/write/dictionary.rs:551-565 | crates/polars-parquet/src/arrow/write/dictionary.rs:618-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/dictionary.rs:551\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/dictionary.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"750be15027c0bcb0cc1a5c71065fa51c7d6700db3c326c0b01a370a9ac1beb10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/cat.rs:24-39 | crates/polars-plan/src/plans/aexpr/function_expr/cat.rs:47-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/cat.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/cat.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6652b20d712346f88e219e17605dca6aafc8d5bf9211632a5ae1a0efbe5bbabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:550-565 | crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:580-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:550\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a18f6cb25461d57fa153f647ff1b9a4dec7cedd1f769c9fc0987bdd4e407cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/sortedness.rs:306-322 | crates/polars-plan/src/plans/optimizer/sortedness.rs:437-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/sortedness.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"48caa429ca7b4957cc9e0afc6d7d30aef9e714ba23a1721dec7451d29eb7e279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/csv/mod.rs:65-80 | crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs:63-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"384256b8bb15d87f1828bb71a7b70f7f0d29fa95496b7f897ee1636d2cc7de39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:611-626 | crates/polars-stream/src/physical_plan/lower_expr.rs:1654-1668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:611\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"412770443227f01c324f7679eaf053c02fd589b50514d09ff3180eb6896d03da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): docs/source/src/rust/user-guide/expressions/folds.rs:57-72 | docs/source/src/rust/user-guide/expressions/folds.rs:73-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/expressions/folds.rs:57\u0060 it begins part-way through the construct above it, so those exact 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, \u0060docs/source/src/rust/user-guide/expressions/folds.rs:56\u0060 calls \u0060clone\u0060 and \u0060docs/source/src/rust/user-guide/expressions/folds.rs:72\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":"docs/source/src/rust/user-guide/expressions/folds.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325f3da93f4be98a350b8d52adaeba6ccfe122c184646b36a17ad6f96f4b9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/polars-io/src/cloud/options.rs:588-602 | crates/polars-io/src/cloud/options.rs:664-678 | crates/polars-io/src/cloud/options.rs:734-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 \u0060crates/polars-io/src/cloud/options.rs:588\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-io/src/cloud/options.rs:603\u0060 calls \u0060with_unsigned_payload\u0060 and \u0060crates/polars-io/src/cloud/options.rs:679\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed88bf2c38c5d8d9b33aa79686780987cc55f8e44eaf13e6b6334aa0ccde9d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/polars-parquet/src/arrow/write/boolean/basic.rs:62-76 | crates/polars-parquet/src/arrow/write/fixed_size_binary/basic.rs:17-31 | crates/polars-parquet/src/arrow/write/primitive/basic.rs:155-169 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/boolean/basic.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72fd0b16b556dcc40ab2be446769b6785695d6ad6c96be0a5874127592c4af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/traverse.rs:15-29 | crates/polars-plan/src/plans/aexpr/traverse.rs:108-122 | crates/polars-plan/src/plans/aexpr/traverse.rs:229-243 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1599fb2a0f77a3acee54c9b739d007f7b50578918f5cbfce6d3c181bc0a8ef1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/polars-stream/src/nodes/dynamic_group_by.rs:294-308 | crates/polars-stream/src/nodes/rolling_group_by.rs:235-249 | crates/polars-stream/src/nodes/sorted_group_by.rs:128-142 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:291\u0060 calls \u0060Ok\u0060 and \u0060crates/polars-stream/src/nodes/sorted_group_by.rs:125\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e647eba64f2622f474a9a72cb8cea291b0b12a494f2ee613a3020e03bf385c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-core/src/chunked_array/cast.rs:606-620 | crates/polars-core/src/chunked_array/cast.rs:670-684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ca\u0060 to \u0060\u0026ListChunked\u0060 in one and \u0060\u0026ArrayChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf2214b6d66dc310e4234ad261f1b0a0fb3baec1d8c20fa82fcc3db9b5910cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201315 lines \u00D7 3): crates/polars-core/src/frame/builder.rs:101-104 | crates/polars-core/src/frame/builder.rs:131-145 | crates/polars-core/src/frame/builder.rs:166-180 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/builder.rs:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/builder.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c0b223c8e706ce95eeee65ab52e55f83c994b31031747e2129d9b95949af83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:553-567 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:734-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:553\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7621ef35a86edfe941646e0639435009a0550f1db4ba09332c0bc4753e6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-expr/src/dispatch/misc.rs:1171-1185 | crates/polars-expr/src/dispatch/misc.rs:1200-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a6f64755a3c87bcde22d3481e81a973ca86b7b634339fb35e56ad0802293a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:91-105 | crates/polars-expr/src/expressions/structeval.rs:194-208 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/expressions/apply.rs\u0060 and \u0060crates/polars-expr/src/expressions/structeval.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e5de01be08306f4364e4d3295f6236f29b306244a966b23d74fff701faf3c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-expr/src/expressions/window.rs:1201-1214 | crates/polars-expr/src/expressions/window.rs:1230-1244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/window.rs:1201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a435d192e92495cca55154678c3266e90e50d4a01de7ebdbb43cd8af3f2b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/to_struct.rs:30-64 | crates/polars-ops/src/chunked_array/list/to_struct.rs:26-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/to_struct.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/to_struct.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d552649933014ef6d1b704595acb5ad5011a6970d7334391dad85330849555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-ops/src/frame/join/dispatch_left_right.rs:102-115 | crates/polars-ops/src/frame/join/dispatch_left_right.rs:132-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/dispatch_left_right.rs:132\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/dispatch_left_right.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfc22609f1a36737ab33eae38c86272ff2f3fc438d61212db7b1d84142b8ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-ops/src/series/ops/round.rs:339-353 | crates/polars-ops/src/series/ops/round.rs:381-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/round.rs:339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7570c9aee24bb9cbd929f13217e208dcae3fe702ff6700b27ca804d7c577a5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs:193-206 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs:158-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs:193\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs:155\u0060 calls \u0060set_len\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs:191\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ac1cfb980fe173bda61b9b4bb11fc329762beb5c7e2727ab42f307bd754d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:607-621 | crates/polars-parquet/src/arrow/write/mod.rs:705-719 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:607\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30903f6f8fcfede29c129e37be25bfdffa9d001554383f0b825700be9fd97db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/dsl/file_scan/mod.rs:1056-1070 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs:58-72 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/file_scan/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.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 \u0060crates/polars-plan/src/dsl/file_scan/mod.rs:1056\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"80148846345436af3335fe2af79bff0ff811056b2ffa16802670c0806bc11c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/array.rs:53-67 | crates/polars-plan/src/plans/aexpr/function_expr/array.rs:220-234 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/dsl/function_expr/array.rs:52\u0060 calls \u0060Slice\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/array.rs:219\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/array.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"123da354e4f4f29f693f5e7e11042edc660caa0c9542769e77143a6be1dc5ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/bitwise.rs:29-43 | crates/polars-plan/src/plans/aexpr/function_expr/bitwise.rs:69-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/bitwise.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/bitwise.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"285501dacd13a828c244d3332fd4b0e8ed302a410dd83eaa003ccdd4f17d0de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/dsl/functions/range.rs:44-58 | crates/polars-plan/src/dsl/functions/range.rs:77-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/functions/range.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/range.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a453ef643e6ac6071d8a0fb8a7bbb1520502e594714497ff449fdf8a63d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/dsl/selector.rs:22-36 | crates/polars-plan/src/plans/options.rs:52-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bbe829ad8308ab27beeb2d9d33778554f183c269dd2abd30edab4e419827dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:1404-1418 | crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:1722-1734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f374a8d04d19d480eb2e00f169c623426d1b72b17c928fce78767bf6bfbb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs:247-261 | crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs:292-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42758301cb24eb2aae8748b5d77db8bfc6c0817c20252feccc50dba19f3d471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:106-120 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:100-114 \u2014 \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa15bb3c249318bffa40bae4019caeeab783081bde19ce11f8dd255b975c190b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:31-45 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/morsel_serializer.rs:32-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:31\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs:46\u0060 calls \u0060clone\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/morsel_serializer.rs:46\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/morsel_serializer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419108bc4548618a6bc4f977b1ffb4bbf60d70f893afee8a6da229c91719dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs:57-71 | crates/polars-stream/src/nodes/io_sources/parquet/metadata_utils.rs:72-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs:57\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb30cd6c22fac892785bb1bce5173c26790d0c11c4746c297081680a5d93cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs:424-438 | crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs:1008-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs:424\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs:423\u0060 calls \u0060default\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs:1007\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b5e2f4dde1f34a34865c23efa5fe75234c31750e6ae2c1a228d89f23aef669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-stream/src/nodes/ordered_union.rs:102-116 | crates/polars-stream/src/nodes/unordered_union.rs:129-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/ordered_union.rs:102\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/ordered_union.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0126d06fed1f145947ce99c4704772323b529c77d1573607db3005ec66933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:174-187 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:205-218 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:399-412 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:431-444 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/simple.rs:174\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3ccdb43e68cc47b65c135712287a6ee087bb39c603077437810f5fd4c8f8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/polars-stream/src/physical_plan/lower_expr.rs:1049-1061 | crates/polars-stream/src/physical_plan/lower_expr.rs:1264-1277 | crates/polars-stream/src/physical_plan/lower_expr.rs:1396-1409 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1049\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb4f52d74a6a4fb3b19c38afa78fa464072217f147ea62d4b9345a4f4eefcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-compute/src/rolling/no_nulls/rank.rs:115-128 | crates/polars-compute/src/rolling/nulls/rank.rs:122-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/rolling/no_nulls/rank.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-compute/src/rolling/nulls/rank.rs:136\u0060 calls \u0060values\u0060, \u0060as_slice\u0060, \u0060validity\u0060 and \u0060crates/polars-compute/src/rolling/no_nulls/rank.rs:129\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/rank.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5caad204056eb2243cb349d9509cc50484ec8230e8dc16ae8476321ade8398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-core/src/chunked_array/arg_min_max.rs:171-184 | crates/polars-core/src/chunked_array/arg_min_max.rs:216-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/arg_min_max.rs:171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arg_min_max.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"737955313bed1262af93603435acd07ebfaa2eeaa83f96143011a1f7c1564d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-core/src/chunked_array/builder/list/binary.rs:33-46 | crates/polars-core/src/chunked_array/builder/list/binary.rs:107-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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 \u0060ca\u0060 to \u0060\u0026StringChunked\u0060 in one and \u0060\u0026BinaryChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/builder/list/binary.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda0d63789a44412b3e686146d0fc34bf53b4ef1883c3a0df69db3549b9b3207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:112-124 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:593-606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ab3c1cd76d9657b6a5ef263389c54aa341ea80d107432d05196bb400b2d9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1088-1101 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1168-1181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1088\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d24147f14bcef17e63384eb4265f0a3e127ee8a843f4e8c17fce205b3863c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-core/src/series/arithmetic/list.rs:551-564 | crates/polars-core/src/series/arithmetic/list.rs:652-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/list.rs:551\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b778d2aaa93051b7d79af403d934cec72148c57fcd738ed7aee12fa148c18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:305-318 | crates/polars-expr/src/expressions/apply.rs:330-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/apply.rs:305\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"28749cc79988167c66a034b5fc6c685605cf366da94243e1b3c4a5ef6d4b656c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-expr/src/expressions/group_iter.rs:106-119 | crates/polars-expr/src/expressions/group_iter.rs:136-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/group_iter.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/group_iter.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63ee71ddcef16ad60aad53b7a24a34ad1da73894841904a785cf697c4abd2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-expr/src/expressions/slice.rs:187-200 | crates/polars-expr/src/expressions/slice.rs:230-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/slice.rs:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"85292bbc2be1d1a40c416c654ab9ec9f0a2c05600f4a993328210db7f5998105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-expr/src/expressions/structeval.rs:242-255 | crates/polars-expr/src/expressions/structeval.rs:285-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/structeval.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e339add4464e74fc36d7761f45a03613bc3c5326297e081f70b749a0da4c90ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-io/src/utils/file.rs:52-65 | crates/polars-io/src/utils/file.rs:77-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/utils/file.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/file.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edc1909409306d059a9c110d0a655a217167b1a4da82257392adca0e92e37f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-lazy/src/frame/mod.rs:1032-1045 | crates/polars-lazy/src/frame/mod.rs:1150-1163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-lazy/src/frame/mod.rs:1032\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f01527f11b98f6d250ee7378f738fb978df9c6bd4d320d1a44b0fecc8252bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-mem-engine/src/executors/group_by_dynamic.rs:51-65 | crates/polars-mem-engine/src/executors/group_by_rolling.rs:86-100 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/group_by_dynamic.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/group_by_rolling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/executors/group_by_dynamic.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/group_by_dynamic.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2286976f55f5990c18729db9d16b8c4364291048f5b4ba7997c913fb85bd26d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-mem-engine/src/planner/lp.rs:824-837 | crates/polars-mem-engine/src/planner/lp.rs:851-864 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/planner/lp.rs:824\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08a1a7bbb8914dfc75b1cc4e697b641ada982be68b759754c097498e05635a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:540-553 | crates/polars-ops/src/chunked_array/gather/chunked.rs:750-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c7c0f7b07bc8643a25dec0a8c61154e81d9c37d09f3006f68f18e7a7155bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/namespace.rs:638-651 | crates/polars-ops/src/chunked_array/list/namespace.rs:675-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/namespace.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1511f6ae8c11dba3b6f52c3ffabf171742a482de2ac575010add3bcb82b581d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:116-129 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:183-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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":"crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab00868fd76ea4ef96cd1010ed62173be5158fb13db9306402c61415b1a89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/namespace.rs:617-630 | crates/polars-ops/src/chunked_array/strings/namespace.rs:658-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/namespace.rs:617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3a228ac6398f91d8775c85db6d88ce50be2f7e85aa0253320e48366d73aea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/frame/join/iejoin/mod.rs:690-703 | crates/polars-ops/src/frame/join/iejoin/mod.rs:824-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/iejoin/mod.rs:690\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd444e4261c972124df148f23c6b73e120a9d5328acbb9ab7f1586169c3e6203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:281-294 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:435-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:281\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf34c0ddc581acfaa3aef3322942f3c9bd5c6820ea9dcccc629e74b6b270c438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:172-185 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:201-213 \u2014 before extracting anything, compare \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3d99d2cd1b97f4449346ce17ca514aad27decdea87da43266ef6d28890faf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:88-101 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:133-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e12d51c6c99243ca7a4a3a5a173b223de0586f01ef4f005f40d5aaa403f7c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs:572-585 | crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs:766-779 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs:572\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"99622b8e97f66804376e3e43c5ccb5eb51f4addfb6e36f45d3497e7ca60c6b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:694-707 | crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:711-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:694\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"08043967e66ca0caf68e872ad5cf05b770f0747548ed47ffe458bce48aa8b7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1162-1174 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1255-1268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1162\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1253\u0060 calls \u0060try_get_supertype\u0060, \u0060temporal_range_output_type\u0060 and \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1161\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb2065156d1e425062458615072a83adf4f4fb21546d0c14e3a14d6d07a3a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/join_utils.rs:183-196 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs:731-744 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/join_utils.rs:183\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_utils.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd538a3c42b5f2498ebe1525eeab4722b33c4966bcfaaa911fee248b64de0723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1129-1142 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1275-1288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs:1129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"83beefa3d8fea9b6fc3d08649f2e766581120f0c0164b5e80968d1a239d87caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/python/pyarrow.rs:382-395 | crates/polars-plan/src/plans/python/pyarrow.rs:827-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 \u0060crates/polars-plan/src/plans/python/pyarrow.rs:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"115e4f400bdd514d9afb8c3b5a1789ed51aac14c7d3751d37bfb25dc05502add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs:28-41 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/io_writer.rs:25-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs:28\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab114dbde73f11bcee3f96354e1e6d83992dd502f2f65a79391497326fc54c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs:285-298 | crates/polars-stream/src/nodes/io_sources/ndjson/line_batch_distributor.rs:99-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs:285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"840eb7dbe4dbabc45e6a8c11a4f154ef2ff5febde939237dc4fa58f52c4ba1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/polars-stream/src/nodes/top_k.rs:394-407 | crates/polars-stream/src/nodes/top_k.rs:534-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/top_k.rs:394\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e3115a2769f0be9ed3cd8c7a5927d2809898679e71451eac18ed7d3a9e0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:41-53 | docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:99-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/time-series/rolling.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa78da0863bb43e4738fae1d42475c563462db30c1b0fbffea0d61d11280796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): docs/source/src/rust/user-guide/transformations/joins.rs:69-81 | docs/source/src/rust/user-guide/transformations/joins.rs:83-95 | docs/source/src/rust/user-guide/transformations/joins.rs:97-109 | docs/source/src/rust/user-guide/transformations/joins.rs:149-161 | docs/source/src/rust/user-guide/transformations/joins.rs:163-175 \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 \u0060docs/source/src/rust/user-guide/transformations/joins.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":"docs/source/src/rust/user-guide/transformations/joins.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919fe247137f9bc1d815b22b7b5e4faaf11500c974a2ce412a170bdc9d67fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/polars-core/src/chunked_array/comparison/mod.rs:667-679 | crates/polars-core/src/chunked_array/comparison/mod.rs:699-711 | crates/polars-core/src/chunked_array/comparison/mod.rs:911-923 | crates/polars-core/src/chunked_array/comparison/mod.rs:938-950 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/comparison/mod.rs:667\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efa6efc5ee6e638ec8a09e10d1a231380ff758cbe2b1af65b5f6cb9fedd1432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/polars-sql/src/context.rs:5049-5061 | crates/polars-sql/src/context.rs:5120-5132 | crates/polars-sql/src/context.rs:7365-7377 | crates/polars-sql/src/sql_visitors.rs:756-768 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:5049\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"44054dca113f005e3a07bca3e159ce0ff60f8d3c665013ceb64e9810816e9cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/polars-sql/src/subquery_outer_select.rs:56-68 | crates/polars-sql/src/subquery_pull_up.rs:184-196 | crates/polars-sql/src/subquery_pull_up.rs:425-437 | crates/polars-sql/src/subquery_pull_up.rs:614-626 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/subquery_outer_select.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_outer_select.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d7d32d6317be3f1bb588d9623253feb1b9195b06fa9e48522e2f103be235d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/polars-compute/src/cardinality.rs:74-85 | crates/polars-compute/src/cardinality.rs:130-142 | crates/polars-compute/src/cardinality.rs:147-159 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/cardinality.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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 \u0060array\u0060 to \u0060\u0026dyn Array\u0060 in one and \u0060\u0026BinaryViewArray\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cardinality.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eb4c10f738646fca9d9af55b80be9a352452bd6d1363e1687b6485f0e49b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/polars-expr/src/reduce/first_last_nonnull.rs:134-146 | crates/polars-expr/src/reduce/first_last_nonnull.rs:214-225 | crates/polars-expr/src/reduce/first_last_nonnull.rs:282-293 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/first_last_nonnull.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last_nonnull.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a725c325647494df575c33d31d918267f2947cec1f8651096e267c9a617a0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-parquet/src/arrow/write/pages.rs:185-197 | crates/polars-parquet/src/arrow/write/pages.rs:209-221 | crates/polars-parquet/src/arrow/write/pages.rs:232-244 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b830eba590f1da12ef21a152af0e6ad235ffa9ae618091fa5f9dd3bde37ab2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-row/src/encode.rs:385-397 | crates/polars-row/src/encode.rs:401-413 | crates/polars-row/src/encode.rs:417-429 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/encode.rs:385\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d68c866036157123e6883a3c43fa3c7c816c5c159dda7dc17b2b03472735e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-stream/src/nodes/dynamic_group_by.rs:399-413 | crates/polars-stream/src/nodes/rolling_group_by.rs:319-331 | crates/polars-stream/src/nodes/sorted_group_by.rs:206-219 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:399\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae55e4553dce3ce3e24cc0455bd2425719b83c5a00e61f2bb9293f1d6b3eb1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:129-141 | crates/polars-stream/src/nodes/io_sources/lines.rs:127-139 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:126-138 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/lines.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 \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc5b1bb2a35377e2e8e4b5a838769a5d392e6d29dd239ee5465183e8e616fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-compute/src/binview_index_map.rs:188-200 | crates/polars-compute/src/binview_index_map.rs:222-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/binview_index_map.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, \u0060crates/polars-compute/src/binview_index_map.rs:221\u0060 calls \u0060get_external_slice_unchecked\u0060 and \u0060crates/polars-compute/src/binview_index_map.rs:187\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f4a162ac4798c1bfddb1cdde9e76fe5020ca81b771b7dbb11a8117d1e3e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-compute/src/moment.rs:176-188 | crates/polars-compute/src/moment.rs:252-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8468034c1d84a15919f9d5d93f06db6b4a4c6c510570b0f0af92f10d75095e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1062-1075 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1139-1152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1062\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63d503178e6c9bf51fd7ee1f113b4e2f0c336057736b7a00a3209bf7d87e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:1262-1277 | crates/polars-core/src/frame/mod.rs:1310-1325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/mod.rs:1262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060idx\u0060 to \u0060\u0026IdxCa\u0060 in one and \u0060\u0026[IdxSize]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"de14686746d56968e19633ef38bb89b282ca6c2988bb65d8e15f776e7ad0c95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:681-693 | crates/polars-core/src/series/arithmetic/fixed_size_list.rs:711-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:681\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e241918c90df06137c58ec18fc51e0d64d09df92c41823fdccd54299759cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-core/src/series/arrow_export/mod.rs:219-231 | crates/polars-core/src/series/arrow_export/mod.rs:270-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arrow_export/mod.rs:219\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf8065baeee5cd291f4753d7cb9dad60dfb40c74b9107b272c940ce7732b1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-expr/src/dispatch/horizontal.rs:44-56 | crates/polars-expr/src/dispatch/horizontal.rs:90-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 \u0060crates/polars-expr/src/dispatch/horizontal.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"445a10aa5fba9a4ec8c6763aa3221f62b7f837a9a2d7f8adf88e7ed2b2390d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-expr/src/dispatch/horizontal.rs:118-130 | crates/polars-expr/src/dispatch/horizontal.rs:163-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/horizontal.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"68551542fa99732a863835862d0b9dc50ecbe6f927960f8eb85c8f0aa90c31fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-expr/src/expressions/slice.rs:186-198 | crates/polars-expr/src/expressions/slice.rs:278-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/slice.rs:186\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d31fc9495dfd521613a7b174a1887c23975eb2083069441c5055a5fa29143fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/polars-expr/src/reduce/cov.rs:99-133 | crates/polars-expr/src/reduce/cov.rs:243-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe420b8293f01a63963e80fe9835ee648c60c937213e3fc533ffe74ce6f3c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-io/src/csv/read/splitfields.rs:289-301 | crates/polars-io/src/csv/read/splitfields.rs:380-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/splitfields.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/splitfields.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218d95c774b10b9f698f1832298a91c76c0220e0dce4ed3bdfba188056a09a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/polars-io/src/utils/byte_source.rs:343-355 | crates/polars-io/src/utils/byte_source.rs:400-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/byte_source.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d7d9e7b5c2ed058f1b7d64505f1f9971f11917085b0e53fad9030929691b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-mem-engine/src/executors/group_by_dynamic.rs:29-41 | crates/polars-mem-engine/src/executors/group_by_rolling.rs:70-82 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/group_by_dynamic.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/group_by_rolling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/group_by_dynamic.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e15522169ff3ae87ec18ac1a210449bf14ef87e8ebd613267e7a0d221001902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-ooc/src/memory_manager.rs:326-338 | crates/polars-ooc/src/memory_manager.rs:416-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ooc/src/memory_manager.rs:326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e33a36dde8b17a7f4700b28d9d08fb5f09c067d7d33f29e55b535cd4321c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:741-753 | crates/polars-ops/src/chunked_array/gather/chunked.rs:792-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a8f02e3a6da081148f88559e80c985ffec10d94f57f309f5ba448613331216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather_skip_nulls.rs:75-87 | crates/polars-ops/src/chunked_array/gather_skip_nulls.rs:108-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060indices\u0060 to \u0060\u0026[IdxSize]\u0060 in one and \u0060\u0026IdxCa\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather_skip_nulls.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8402b0309862aeb36f66e95bdc5eaf11d541a1924d4249bf90b37347f65b26d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/get.rs:33-46 | crates/polars-ops/src/chunked_array/list/get.rs:57-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/get.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726779ea091c6935a3d3000a49233cfc1120d256ff55f43ef839449a17a2caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:73-85 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:140-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81da8e4d6524050021098602e831f491110225ebc0cb4bb8f255285f6ecc177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs:272-284 | crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:909-921 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1597ec24ff7622151a2c7b2ad84a7e0ca741fbe8032133c0a298782a25b0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:314-324 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:475-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:314\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc8ce3a41c373e2b909c58184ce2b82cdd316bc2b2e86018dfb9cf3c9bf682f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/nested.rs:32-44 | crates/polars-parquet/src/arrow/read/deserialize/nested.rs:47-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/nested.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":"crates/polars-parquet/src/arrow/read/deserialize/nested.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc487a890eebc91b01d8fe25d67c6177626b4c6e7dfe05ca1850a0923007e21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:618-630 | crates/polars-parquet/src/arrow/write/mod.rs:1000-1012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"404d614c5dcb30c17e1b7455c3eb99f91cad8fcccbe554908a6f0562e70ffb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:716-728 | crates/polars-parquet/src/arrow/write/mod.rs:938-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:716\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cafcf0a561c28e3ee2f9bbe9fd1e862f1f8e200e5f692a0a61f244e4801a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:929-941 | crates/polars-parquet/src/arrow/write/mod.rs:991-1003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:929\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7be0b4fad46a11e183999cc5228e790204c0aeee4fd4244502ed4b159d9963c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:631-644 | crates/polars-plan/src/plans/aexpr/schema.rs:706-719 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11a479917681f88039bd76679c917861a0393a80083bd79a5bb47a9b0a3e0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-plan/src/plans/builder_ir.rs:107-119 | crates/polars-plan/src/plans/builder_ir.rs:140-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/builder_ir.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/builder_ir.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"21405499c139b50bc5ba2a7b4a51ca6ab86e93ae5e972b36bc29f9272fa73d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/sortedness.rs:35-46 | crates/polars-plan/src/plans/optimizer/sortedness.rs:181-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 \u0060crates/polars-plan/src/plans/optimizer/sortedness.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae493030296db7e3c9fed0d97650cac0e7df6fe1f16e17d1c949ce40bb09a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/polars-python/src/functions/lazy.rs:188-200 | crates/polars-python/src/lazyframe/general.rs:753-764 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/functions/lazy.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/lazy.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d891be6e602d50d701ce040bd4088a74a014d23d7e519fd7b5a3330bb51cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-stream/src/nodes/dynamic_group_by.rs:340-352 | crates/polars-stream/src/nodes/rolling_group_by.rs:274-286 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf121e4fda9b30f95a8f0401e08af1686b48fafdcbcb01b20e11a85cc8f9dfe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:520-529 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:525-537 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs:520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1514bcb85c79e52365264c62e84b44a4fd7fafbf6c8cda0ccaa6b18cb5fc3912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:1693-1705 | crates/polars-stream/src/physical_plan/to_graph.rs:1762-1774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1693\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc41329b5b65b422d80af3405770ac0020b4991a9714cb3b060203368897ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): docs/source/src/rust/user-guide/transformations/pivot.rs:42-54 | docs/source/src/rust/user-guide/transformations/pivot.rs:71-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/transformations/pivot.rs:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/pivot.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f096de4d5d2e6b77a5fda5ea745931dc92a96a7f6048f3d61073244c8e21d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:173-184 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:204-215 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:253-264 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:280-291 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:398-409 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:430-441 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/simple.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c191169afec20b41b6b7fa8c1e029d3cabfed0f175f63e0b694764c679d370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 6): crates/polars-parquet/src/arrow/write/mod.rs:638-649 | crates/polars-parquet/src/arrow/write/mod.rs:671-681 | crates/polars-parquet/src/arrow/write/mod.rs:737-748 | crates/polars-parquet/src/arrow/write/mod.rs:957-968 | crates/polars-parquet/src/arrow/write/mod.rs:1018-1029 | crates/polars-parquet/src/arrow/write/mod.rs:1051-1061 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:638\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b97ce6364bbcbf719587fe9cf7bf2762aa659be6bceaf8ce21cd2859c3026d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/polars-time/src/chunkedarray/datetime.rs:48-59 | crates/polars-time/src/chunkedarray/datetime.rs:69-80 | crates/polars-time/src/chunkedarray/datetime.rs:107-118 | crates/polars-time/src/chunkedarray/datetime.rs:176-187 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/datetime.rs:48\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/datetime.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d92f3b128c526bfa2ee0b8205194f067b380068302cf74f7c48ddc6d2c59e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-core/src/chunked_array/mod.rs:653-664 | crates/polars-core/src/frame/column/mod.rs:534-545 | crates/polars-core/src/series/mod.rs:359-370 \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":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"62169a75f3f8dfbc68252b28b733f8a7df4866d4646033491de2f33afdc63613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-core/src/series/arithmetic/borrowed.rs:214-225 | crates/polars-core/src/series/arithmetic/borrowed.rs:235-246 | crates/polars-core/src/series/arithmetic/borrowed.rs:256-267 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/borrowed.rs:214\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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 \u0060\u0026Float16Chunked\u0060 in one and \u0060\u0026Float32Chunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8446b4e241df0e510a76b4cc8aec7c288d8d38698597ce2442cc1d3d455415b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): crates/polars-core/src/utils/supertype.rs:229-236 | crates/polars-core/src/utils/supertype.rs:250-257 | crates/polars-core/src/utils/supertype.rs:309-320 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd93406dd58a633db2d30d35d05cd6ed30de6f37b6cb07cea2f5de52fc9a5f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-ops/src/chunked_array/array/sum_mean.rs:69-80 | crates/polars-ops/src/chunked_array/array/sum_mean.rs:105-116 | crates/polars-ops/src/chunked_array/array/sum_mean.rs:126-137 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/sum_mean.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":"crates/polars-ops/src/chunked_array/array/sum_mean.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e02a8713efffd1f43a9ce35743b14c9e47c02280a59167dfefcd97f5ebf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-ops/src/chunked_array/scatter.rs:73-84 | crates/polars-ops/src/chunked_array/scatter.rs:118-129 | crates/polars-ops/src/chunked_array/scatter.rs:170-181 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/scatter.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/scatter.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8647cdc422ce2b9e762df048c7aab19f39be5c9e142004ba4754a9e246db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-compute/src/gather/sublist/fixed_size_list.rs:51-62 | crates/polars-compute/src/gather/sublist/fixed_size_list.rs:70-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/gather/sublist/fixed_size_list.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060index\u0060 to \u0060i64\u0060 in one and \u0060\u0026PrimitiveArray\u003Ci64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/sublist/fixed_size_list.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e544172193fbee45648bf72a62240c32c3bd54a931f3c63f98a6c319ebd9d937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/polars-compute/src/propagate_nulls.rs:240-251 | crates/polars-compute/src/trim_lists_to_normalized_offsets.rs:62-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/propagate_nulls.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/propagate_nulls.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c93892989116367f71524f20bfec54eb71f8b47fada0e444421d7f71fb38d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:208-219 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:278-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:208\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0a9ca4b3e6bb877abc01104529ba14b18cf0208f69c26b02feb2fb126ab9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:391-402 | crates/polars-core/src/series/arithmetic/list.rs:405-416 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:391\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"19415b52202f159336aca2749ef6f9c9ffd2dc7264cf98f4d0ed773c07a8bbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:309-320 | crates/polars-expr/src/expressions/structeval.rs:124-135 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/expressions/apply.rs\u0060 and \u0060crates/polars-expr/src/expressions/structeval.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/polars-expr/src/expressions/apply.rs:309\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe677cfd5e53cfd81e7a4bd16df6b0fa3e281610cde9eb51ec0055e0f7f0edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:621-632 | crates/polars-expr/src/expressions/binary.rs:402-412 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/apply.rs:621\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebadc4e048cf26467ea15cff9000d993be1667c97396852b70bd7b74947d8bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/expressions/eval.rs:75-86 | crates/polars-expr/src/expressions/eval.rs:259-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-expr/src/expressions/eval.rs:258\u0060 calls \u0060empty_with_height\u0060 and \u0060crates/polars-expr/src/expressions/eval.rs:74\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc2c0bdb8d7eeed23f0d4fe433475e5942d381f0a23eb41d7300e83db57ca43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/expressions/window.rs:73-84 | crates/polars-expr/src/expressions/window.rs:105-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"547112b7864a38dcae68c60643a8499f4f4ad131a43d78de31bf30fe19784a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/idx_table/row_encoded.rs:147-158 | crates/polars-expr/src/idx_table/row_encoded.rs:186-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 \u0060crates/polars-expr/src/idx_table/row_encoded.rs:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/row_encoded.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"635c1301b135df9dcaee4b7a6be53386cb7c5aa7beb900605219c6726a79bc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:471-482 | crates/polars-expr/src/reduce/mod.rs:726-737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/mod.rs:471\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/reduce/mod.rs:484\u0060 calls \u0060has_nulls\u0060 and \u0060crates/polars-expr/src/reduce/mod.rs:739\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6948e8579ce58fb9a1b9a9a1ff5feb10c3c91977bb65479252337183ea48399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/polars-io/src/cloud/options.rs:644-655 | crates/polars-io/src/cloud/options.rs:721-730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/cloud/options.rs:644\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/options.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33c3cf73cbc623039cce1ad79daf915301cb675cdb0e375ff5ce90cf8b44b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-lazy/src/frame/mod.rs:1085-1096 | crates/polars-lazy/src/frame/mod.rs:1131-1142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-lazy/src/frame/mod.rs:1085\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"991bfb1f3ba4137c1ae2e0f31571cde84cd1e105158adfee2f01783de1281a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/get.rs:31-42 | crates/polars-ops/src/chunked_array/array/get.rs:46-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":"crates/polars-ops/src/chunked_array/array/get.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"152cc987680c220afc78239edad3accb4bfee4a9a84ecd9ed4f3b79a501d89ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/min_max.rs:17-28 | crates/polars-ops/src/chunked_array/list/min_max.rs:128-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/min_max.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc411ae6958c570b5870d04a0e018f21ffad9ecd78f346153115755596f2ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/sets.rs:148-170 | crates/polars-ops/src/chunked_array/list/sets.rs:251-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/sets.rs:148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sets.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a6d6859d12bdde46af881da44cf2cf47d4f024207366e2f2eba89db1ad4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/extract.rs:82-93 | crates/polars-ops/src/chunked_array/strings/extract.rs:106-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/extract.rs:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-ops/src/chunked_array/strings/extract.rs:104\u0060 calls \u0060compile_regex\u0060, \u0060capture_locations\u0060 and \u0060crates/polars-ops/src/chunked_array/strings/extract.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":"crates/polars-ops/src/chunked_array/strings/extract.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97018f78676d3852255dbf8f25e2b257d9eb2b8a825c8bcdae7ccddcdc5d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/polars-ops/src/chunked_array/top_k.rs:153-163 | crates/polars-ops/src/chunked_array/top_k.rs:234-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/top_k.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c712d04be1db9dc2a92eca5b76d368dbd0fed6284a238b6c1ae89f1ffaeb581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:42-53 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"861ca2ac23d5e622c7ceff5803c27f727e81c0075add1a5039e833de9c2f253f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:606-617 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:739-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:606\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3cb1e8231ad25d5c51abc21a47210b3662b6368dd968d29206d1b1407395c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-parquet/src/arrow/write/binary/basic.rs:71-82 | crates/polars-parquet/src/arrow/write/boolean/basic.rs:67-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/binary/basic.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 before the matched lines, \u0060crates/polars-parquet/src/arrow/write/boolean/basic.rs:65\u0060 calls \u0060validity\u0060 and \u0060crates/polars-parquet/src/arrow/write/binary/basic.rs:69\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f7c3581822fcd84434aa43a6ad92f28b2b4ed57c742228b89bfe4953986e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/dsl/file_scan/mod.rs:1253-1264 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs:343-354 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/file_scan/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.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 \u0060crates/polars-plan/src/dsl/file_scan/mod.rs:1253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2231c8f953a9e79cb92ec360a38f54c8e3121065a322a424894e997451abbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/traverse.rs:358-369 | crates/polars-plan/src/plans/aexpr/traverse.rs:470-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb953b41da81d13a65f20f285b4496c14ce89bd8fb9c96bc40dad4034ac9cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:679-690 | crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:713-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs:679\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"91830466377e2b7b3938c18623775ce110177666d66e214840882c0247da5d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_check/mod.rs:21-32 | crates/polars-plan/src/plans/conversion/type_check/mod.rs:34-43 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_check/mod.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":"crates/polars-plan/src/plans/conversion/type_check/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7d2fd4b88bff50ad29ec3cf948a0d04261c864b464d241e90a56417ecf7e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/plans/ir/dot.rs:274-285 | crates/polars-stream/src/physical_plan/fmt.rs:631-642 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/ir/dot.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a66c21b1d73a00bc90ab7d4f7c77cb4f2fe9641415cb077ac08fe243e37b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/plans/to_description.rs:473-484 | crates/polars-stream/src/physical_plan/to_description.rs:973-984 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/plans/to_description.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_description.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/to_description.rs:473\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"da02077151847a7bdcc2be5d8155e75517ec9c416e637ce35a39b07a3fdd5627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-stream/src/nodes/dynamic_group_by.rs:423-434 | crates/polars-stream/src/nodes/rolling_group_by.rs:342-353 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:423\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03dc8d215789eed361e1200cd4fadcf673f59029f4601988f160a13e1221519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs:79-90 | crates/polars-stream/src/nodes/io_sources/parquet/metadata_utils.rs:94-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9a21b122e2e6d6efe5c6925852c94637c979390e841344fd98f266ba614e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.rs:198-209 | crates/polars-stream/src/nodes/io_sources/ndjson/row_index_limit_pass.rs:57-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 \u0060crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.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":"crates/polars-stream/src/nodes/io_sources/ndjson/negative_slice_pass.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1f64b31a9edc13ab5307acccc28bef3aa936e50b03fb239ad980ec1865436c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:829-840 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1250-1260 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1250\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4642be542d04d1e698b78a48496aa1255867f8bd0d0b888ded9a9b6eeb6c7784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-stream/src/physical_plan/fmt.rs:788-799 | crates/polars-stream/src/physical_plan/fmt.rs:820-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/fmt.rs:788\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8059ff9e3ca738c43a84af1b706d4b4b0bc3ee9276c00f971d4c1cf17e0f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:781-792 | crates/polars-stream/src/physical_plan/lower_expr.rs:2174-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606a5eeb8be7dbeae300a0360c45beed4fda5531e27d1bfb90c05a87981e151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-time/src/windows/group_by.rs:672-683 | crates/polars-time/src/windows/group_by.rs:692-703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/windows/group_by.rs:672\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa8826abdfab154356932200e0f104778c25b8c136d57f5a469f93baae4a2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): docs/source/src/rust/user-guide/concepts/expressions.rs:79-89 | docs/source/src/rust/user-guide/concepts/expressions.rs:91-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 \u0060docs/source/src/rust/user-guide/concepts/expressions.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/concepts/expressions.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2974288c318336ab73b2a639891af8b49666e2a21b9589ec0cb17d9a9d92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/source/src/rust/user-guide/expressions/aggregation.rs:167-178 | docs/source/src/rust/user-guide/expressions/aggregation.rs:188-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/expressions/aggregation.rs:167\u0060 it does not close everything it opens, so those exact 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, \u0060docs/source/src/rust/user-guide/expressions/aggregation.rs:163\u0060 calls \u0060get_name\u0060, \u0060col\u0060, \u0060lit\u0060 and \u0060docs/source/src/rust/user-guide/expressions/aggregation.rs:184\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":"docs/source/src/rust/user-guide/expressions/aggregation.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2a05a81d4c4f1dfaaea47eddb6feca2d7f3e28eaecfc43270efc1130c45d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/source/src/rust/user-guide/transformations/pivot.rs:60-71 | docs/source/src/rust/user-guide/transformations/pivot.rs:88-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 \u0060docs/source/src/rust/user-guide/transformations/pivot.rs:60\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"docs/source/src/rust/user-guide/transformations/pivot.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7b1d468fc2fea6fbe733be79c53508729299210f38f2bedea3ed40fb4cf983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/source/src/rust/user-guide/transformations/time-series/resampling.rs:13-24 | docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:110-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/transformations/time-series/resampling.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/time-series/resampling.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a64086ac5900eb18b1a6a2213de9b9987c2e559f439ccff555bd0ee82498e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): crates/polars-sql/src/subquery.rs:2927-2937 | crates/polars-sql/src/subquery.rs:3066-3076 | crates/polars-sql/src/subquery.rs:3110-3120 | crates/polars-sql/src/subquery.rs:3427-3437 | crates/polars-sql/src/subquery.rs:3669-3679 | crates/polars-sql/src/subquery_pull_up.rs:151-161 | crates/polars-sql/src/subquery_pull_up.rs:1287-1297 | crates/polars-sql/src/subquery_pull_up.rs:1333-1343 | crates/polars-sql/src/subquery_pull_up.rs:1429-1439 \u2014 there are 9 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f7ee4dc9cf7503216d15ad14938599666ccd26145016ac6426422e47bd835d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/polars-core/src/frame/group_by/aggregations/mod.rs:535-544 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:716-725 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:819-829 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:535\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b05eaea4adb12ecc4fe589622ad1b44f12c7ee3bf0b7321ee87c9acbf97a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1281-1291 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1326-1336 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1371-1381 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d72c971959b1d519264f0878d7ad8cdcd43fb481b51e4203fdc96f0f0fe6467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-ops/src/series/ops/clip.rs:68-78 | crates/polars-ops/src/series/ops/clip.rs:104-114 | crates/polars-ops/src/series/ops/clip.rs:140-150 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/clip.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":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5a85d7e8bb8ff2b185515cb925389983547d3878cddf2e23a61e04dff018a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/traverse.rs:39-49 | crates/polars-plan/src/plans/aexpr/traverse.rs:132-142 | crates/polars-plan/src/plans/aexpr/traverse.rs:253-263 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5a07b50944ba2cd7020e773e0a59ffa04129e64c751c5b328627c135c6665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:867-875 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:894-903 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:954-964 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:867\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"9971a56b1e6f19015795184d97a4a01825db3b412fbe76f6374dd1b4f717981c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-stream/src/physical_plan/lower_expr.rs:1432-1442 | crates/polars-stream/src/physical_plan/lower_expr.rs:1456-1466 | crates/polars-stream/src/physical_plan/lower_expr.rs:1507-1517 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1432\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f21c861fd598a83b4bfbd2dec18ade2946619c2292a5958a8a4053d3c50b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): docs/source/src/rust/user-guide/concepts/expressions.rs:69-78 | docs/source/src/rust/user-guide/getting-started.rs:98-108 | docs/source/src/rust/user-guide/getting-started.rs:110-119 \u2014 before extracting anything, compare \u0060docs/source/src/rust/user-guide/concepts/expressions.rs\u0060 and \u0060docs/source/src/rust/user-guide/getting-started.rs\u0060 as WHOLE FILES: this scan already matched 5 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/concepts/expressions.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"docs/source/src/rust/user-guide/concepts/expressions.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d44d75473cda5be31630ef9690f166e0a5db3b812a5fcf158270b5c9ccfb0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-compute/src/rolling/moment.rs:324-334 | crates/polars-compute/src/rolling/sum.rs:185-195 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/rolling/moment.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/moment.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf08a2ef127140003857bce7fae4871c58391d17f4a9c4e825e6e83feeea23e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/chunked_array/comparison/categorical.rs:39-49 | crates/polars-core/src/chunked_array/comparison/categorical.rs:51-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/categorical.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6d0b8b8f9faa5a2688a2942055e592b9b8b870aabfccb9f0e12fc01f3d6733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:599-610 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:780-791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:599\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"08602233b686efd2a14d52dce62342a907ab23509b599a452138027931d3ba71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1040-1051 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1117-1128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1040\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1039\u0060 calls \u0060rechunk\u0060 and \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1116\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7dfcab5fd48afcffd46278478c5651084c8fae576c2fc5da753e38ee93aacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:1830-1840 | crates/polars-core/src/frame/mod.rs:1900-1910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"25665704692a693dc4523c47a5250c080bac23e490d40372a8ed99997d9577e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:369-379 | crates/polars-core/src/series/arithmetic/list.rs:358-368 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1bccdfc4d3132ce4b105139173e5f5585b99e2d230a308c188d76af4e7584a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:448-458 | crates/polars-core/src/series/arithmetic/list.rs:485-495 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-core/src/series/arithmetic/list.rs:497\u0060 calls \u0060match\u0060, \u0060is_none\u0060 and \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:460\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9dc2376ee5adfb1ed15160d7572d917f10edbec33d3196e9dad6cd99bf0340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/series/from.rs:742-752 | crates/polars-core/src/series/from.rs:771-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/from.rs:742\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"895420a07aab749ecb22150ffd9e24b45e60ef1c1f2ae83903cd996ed4a9624e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/utils/mod.rs:1019-1029 | crates/polars-core/src/utils/mod.rs:1045-1055 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b00a1e9aafba4e6a0b463b5dad76fd02ac9cff6e580e91e6aaf5485c17c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:114-123 | crates/polars-expr/src/dispatch/groups_dispatch.rs:166-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 \u0060crates/polars-expr/src/dispatch/groups_dispatch.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fa8a7c51ca916d9fa8a10f5a42f59ff0ac385a49714d9663f83af45e85164f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:424-434 | crates/polars-expr/src/dispatch/groups_dispatch.rs:954-963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/groups_dispatch.rs:424\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f55c4640d430ffb268219610441d75a9b6ffeee83db20bfaaa5a245913daad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-expr/src/expressions/aggregation.rs:198-208 | crates/polars-expr/src/expressions/aggregation.rs:211-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/aggregation.rs:198\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"000ed9840b5b6633fed3895e24326481e7958a8ec89dfedcd3f303936eb4fa49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-expr/src/expressions/sortby.rs:193-204 | crates/polars-expr/src/expressions/sortby.rs:211-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/sortby.rs:193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/sortby.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3365b3d0a67ab6c11d838644378839983fad6587d351cf7992f39f50d8177e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-expr/src/reduce/implode.rs:101-113 | crates/polars-expr/src/reduce/unique.rs:256-268 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/implode.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/implode.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"016575f0185e601a2e7a2b3058d10fe6a05b8cc52bb5c7cdf15e98dd16bdea6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-expr/src/reduce/implode.rs:245-255 | crates/polars-expr/src/reduce/unique.rs:531-541 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/implode.rs:245\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/implode.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec074ec1b3db2b57cd215522297a5f2bd8f4b33dfdc346630bba3472282d51f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-io/src/cloud/credential_provider.rs:795-805 | crates/polars-io/src/cloud/credential_provider.rs:980-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/cloud/credential_provider.rs:795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/credential_provider.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f523535eac2a2c5e0d16d68aa772613f17171c04473383a3f80acb3d359bdb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-io/src/csv/read/schema_inference.rs:106-117 | crates/polars-io/src/csv/read/schema_inference.rs:175-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/schema_inference.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"235180b0eaca8d76866948e2027fc6a08c8f30d2326a89750519840c82b7e11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-io/src/predicates.rs:381-391 | crates/polars-plan/src/plans/aexpr/predicates/mod.rs:28-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa49713c1eec1d59e94f612e3f2d6beeb7c763f10121fae8770be72a47d5d3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-json/src/json/write/mod.rs:51-61 | crates/polars-json/src/ndjson/write.rs:53-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7ed28cceb166b624fc96f0a8fbf3a130db475bfe033855ff87703ae64f7fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:143-153 | crates/polars-ops/src/chunked_array/binary/slice.rs:156-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f473b665a0d81d3bb2e6aa78797da18e5817d3037654ae4ee3a04e375f9a1a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-ops/src/frame/join/asof/default.rs:37-46 | crates/polars-ops/src/frame/join/asof/default.rs:54-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/asof/default.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/default.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21fc14a3245f92aee1a892569183407d7b882ef81a8c857b8c280faad9c7c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/frame/join/asof/groups.rs:311-321 | crates/polars-ops/src/frame/join/asof/groups.rs:343-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/asof/groups.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/groups.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"460af171a42962c007b768af4ea368d1ef863ed2d1236f9757d2d9e53b5cb523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:242-252 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:367-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3888a8e809dc0c984880ba7ac31e2410e3fb42d9c970e0471fb86736054733ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:19-29 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:103-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee48ef9ae1a4c1eefaac38ac6f0eb6ea827471360a9a46961d45cef4acbd23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/frame/join/iejoin/mod.rs:268-278 | crates/polars-ops/src/frame/join/iejoin/mod.rs:334-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/iejoin/mod.rs:268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1554ec98ac491e2d675e5f9deaaf5ec77aec96371f538cbf64090b1ed324bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/frame/join/merge_join.rs:301-311 | crates/polars-ops/src/frame/join/merge_join.rs:312-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b3c036573f812d2346520b9d9ceb26361bacfa12fa7febce29af189462de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-ops/src/series/ops/cut.rs:14-23 | crates/polars-ops/src/series/ops/cut.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cut.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2f4e2b0d17e097e2932ca87351482800e64f706d2f632153c150baf0ad63a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/ewm.rs:74-84 | crates/polars-ops/src/series/ops/ewm.rs:124-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/ewm.rs:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/ewm.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7787e2bcab8d6fda1f0a32d20587043c4a55dd1dbbb5bd68553ae69d1ce61cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/ewm.rs:86-96 | crates/polars-ops/src/series/ops/ewm.rs:136-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/ewm.rs:86\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/ewm.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4450cabe2a763fb7ddc5a57906b0d543d5c8ffed1161066dcadf055bbfb10e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/ewm.rs:98-108 | crates/polars-ops/src/series/ops/ewm.rs:148-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/ewm.rs:98\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/ewm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6c6bf4a723a9e483d79cfb998496b072d36e262034a816d6fc2e5af483f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-ops/src/series/ops/interpolation/interpolate.rs:109-118 | crates/polars-ops/src/series/ops/interpolation/interpolate.rs:134-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/interpolation/interpolate.rs:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b4607feb63957e31825631b20f62bd3145060bdddc45caca60245a02302add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/is_first_distinct.rs:79-89 | crates/polars-ops/src/series/ops/is_last_distinct.rs:149-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_first_distinct.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f3e373d70a097c855df198a15cdcfd0e7e1b30c02984cec73f5a8f4e15a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:348-358 | crates/polars-ops/src/series/ops/is_in/mod.rs:435-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff49bf4eaf804e18ccfea1bf2d5c6fa8d9fb1b14ae485ed63a8650943df76b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:361-371 | crates/polars-ops/src/series/ops/is_in/mod.rs:381-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcceecb8f7968a110473be1f93aed300a573d1ff87a60e70bd4b5f647e1ab49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:405-420 | crates/polars-ops/src/series/ops/is_in/mod.rs:493-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:405\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e41ffba126d1d7b199d5829dd31cdc9048fa671540148507b1f610021f0af32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:448-458 | crates/polars-ops/src/series/ops/is_in/mod.rs:468-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcd43c26c4addef14440617aa04065b12117ead76cd80151740bec1c9dcf9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:449-459 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:471-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:449\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001adeb8639e16ac662a3c51ba1fb65bef3d28571a72eeda0b96efd4cfd8ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/simple.rs:414-424 | crates/polars-parquet/src/arrow/read/deserialize/simple.rs:446-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/simple.rs:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/simple.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d084b2f980f93c5ddb267e2d8f2025ac3d3389bebafc08b9bef6e12f57196dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:133-143 | crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:166-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 \u0060crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aeee345149ef8684e26f1a0ae3db2926a9f8722039e0c2ffeae7dc490f0065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:623-633 | crates/polars-parquet/src/arrow/write/mod.rs:721-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:623\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1d24827d463522e80ad14adc47614406ee5512a828ab409fc72ddba5a1bdbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-parquet/src/parquet/page/mod.rs:125-135 | crates/polars-parquet/src/parquet/page/mod.rs:324-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-parquet/src/parquet/page/mod.rs:137\u0060 calls \u0060slice_mut\u0060 and \u0060crates/polars-parquet/src/parquet/page/mod.rs:335\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/page/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1e85c4a81039139bb3a4bcea0612959273a24420b21f18f2fecf7a985edfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/dsl/options/sink.rs:108-118 | crates/polars-plan/src/dsl/options/sink.rs:136-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/options/sink.rs:108\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/sink.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d4c1f6afaee112c5a61c56da6ef17f7d0b2c135213f8ae94646c24f20fc034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/determinism.rs:273-283 | crates/polars-plan/src/plans/aexpr/function_expr/array.rs:166-176 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/determinism.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8f8c0b2cdac0aa7101d954edd088a5df4fd6450ddcde29f541a9d2a0622dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:296-306 | crates/polars-plan/src/plans/aexpr/schema.rs:308-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:296\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a53a11851ec625e3243d20f320b3876465e61785d32bdee8a28fc78d1b54a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/conversion/stack_opt.rs:167-177 | crates/polars-plan/src/plans/conversion/stack_opt.rs:193-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/stack_opt.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb55c0865ef005b34667a9dc32c265d5b160bf9c97d63bd43ffbfa3928269e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:727-737 | crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:740-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"f466a596d03ee9de35ad1497bc8521fb6016b33b1253b769007b79e7aa264f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1140-1150 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1229-1239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"467d9f097477ba5672d14a3d88141dbeba61a8747b135d0983fc15b3b10395a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/cse/csee.rs:542-552 | crates/polars-plan/src/plans/optimizer/cse/csee.rs:583-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/cse/csee.rs:542\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/csee.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8414aa6ae448f12476ff597730184220e8818327cff4e298f759753dfae7b8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/join_utils.rs:170-180 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs:718-728 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/join_utils.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_utils.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e3f04b021d618bfc00b0efaaf21d7bc28386c7c4788bc3a0e664abb4ecf39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-row/src/encode.rs:244-254 | crates/polars-row/src/encode.rs:277-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/encode.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b4b0a1288ecb2a8ca10e008434025987f5b24aed67f0d8964362a714f528cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-row/src/encode.rs:843-853 | crates/polars-row/src/encode.rs:874-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/encode.rs:843\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e5488556cd7a6544c3f2256b7d8cdb17b76946fce1c4352134d39c07bf6022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-sql/src/subquery.rs:2875-2885 | crates/polars-sql/src/subquery.rs:4740-4750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/subquery.rs:2875\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a4504a61e4863e55961a0e7b5e56df7f0f70a194396a554fcbd18d4e2385e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-sql/src/subquery.rs:3889-3899 | crates/polars-sql/src/subquery_outer_select.rs:70-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":3889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c896bda51f04dee82351b889ecf049a40c35e1846a00a9aa5d968f295a334d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-sql/src/table_functions.rs:329-339 | crates/polars-sql/src/table_functions.rs:384-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/table_functions.rs:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/table_functions.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9554cf194c75a05aaa5a7d08aa629fc623e5268dc7946bda2fddc2c803d0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs:99-109 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs:111-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c1b0cd5550ffd79aaf64f8548394f2bf632d7452e941aa542b1ec904c76fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:882-892 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:1294-1304 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs:882\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ca7eaefcba324b61f20c9b6edfe91e6d98ef89aa2f47ac5e4eaa2257a9337b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/nodes/shift.rs:79-89 | crates/polars-stream/src/nodes/shift.rs:139-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/shift.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/shift.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb416f2a3adbebf673232ff58c9233c5bb191e97417e11b2ec1caf88ea8e720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:1478-1488 | crates/polars-stream/src/physical_plan/lower_expr.rs:1507-1517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1478\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc7ee399437518cc40284fb0a76b5083a5dab91d45e8ec4933d541eed4b62e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_group_by.rs:419-428 | crates/polars-stream/src/physical_plan/lower_group_by.rs:541-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e037fa186c88e66eab3042d6720df9b087a92713049077d6fc23b67c9821d5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_group_by.rs:1510-1520 | crates/polars-stream/src/physical_plan/lower_group_by.rs:1676-1686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_group_by.rs:1510\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc31173b7c9062f034d09495254ffd0d1dd112a36a905f694ed95229e67cb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:703-713 | crates/polars-stream/src/physical_plan/to_graph.rs:1056-1066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"be228771615e0e355a853710f210720239b7eb9d1656f21d13e2293a816c658c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:398-408 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:479-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd50c95bdcd40d263b36c5dd225d071e0d930c8050af9def14c26a776beba31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-utils/src/parma/raw/mod.rs:299-309 | crates/polars-utils/src/parma/raw/mod.rs:318-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-utils/src/parma/raw/mod.rs:299\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"165dad5337d9b791c39e7e05c5ccba5a552f2c5514212ee95bc9a409e9ffc55d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/source/src/rust/user-guide/getting-started.rs:43-53 | docs/source/src/rust/user-guide/getting-started.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 \u0060docs/source/src/rust/user-guide/getting-started.rs:43\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"docs/source/src/rust/user-guide/getting-started.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aef1a70a4838bc11a13b7361c8a7837b591a2b11060a6ae3c664be8885456f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11): crates/polars-sql/src/subquery.rs:2136-2145 | crates/polars-sql/src/subquery.rs:2930-2939 | crates/polars-sql/src/subquery.rs:3069-3078 | crates/polars-sql/src/subquery.rs:3113-3122 | crates/polars-sql/src/subquery.rs:3430-3439 | crates/polars-sql/src/subquery.rs:3672-3681 | crates/polars-sql/src/subquery_group_by.rs:84-93 | crates/polars-sql/src/subquery_pull_up.rs:154-163 | crates/polars-sql/src/subquery_pull_up.rs:1290-1299 | crates/polars-sql/src/subquery_pull_up.rs:1336-1345 | crates/polars-sql/src/subquery_pull_up.rs:1432-1441 \u2014 there are 11 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 11 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/subquery.rs:2136\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-sql/src/subquery.rs:2134\u0060 calls \u0060push\u0060, \u0060clone\u0060 and \u0060crates/polars-sql/src/subquery.rs:2929\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f00a9f8d935bdf54da49a624a504fce62b9ca60e7f09a08faae158ff52aaeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 7): crates/polars-expr/src/reduce/any_all.rs:64-74 | crates/polars-expr/src/reduce/any_all.rs:163-173 | crates/polars-expr/src/reduce/any_all.rs:269-280 | crates/polars-expr/src/reduce/any_all.rs:395-406 | crates/polars-expr/src/reduce/bitwise.rs:185-195 | crates/polars-expr/src/reduce/min_max.rs:464-474 | crates/polars-expr/src/reduce/min_max.rs:580-590 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/any_all.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/any_all.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c37a224f8b1853111a752e56771c632fd89388c610a002154bd946cb893589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 5): crates/polars-stream/src/physical_plan/lower_expr.rs:652-659 | crates/polars-stream/src/physical_plan/lower_expr.rs:699-708 | crates/polars-stream/src/physical_plan/lower_expr.rs:730-737 | crates/polars-stream/src/physical_plan/lower_expr.rs:2373-2380 | crates/polars-stream/src/physical_plan/lower_expr.rs:2511-2518 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:652\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4702983d5808eb9aba997bfda7cd395f7305d116b79d5a11899bafae653760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-core/src/chunked_array/cast.rs:606-615 | crates/polars-core/src/chunked_array/cast.rs:634-643 | crates/polars-core/src/chunked_array/cast.rs:670-679 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ca\u0060 to \u0060\u0026ListChunked\u0060 in one and \u0060\u0026ArrayChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb25c8f8bf5ee0a5316f902b22af054c9e7b8d94a593d5cfdef32eca563503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-core/src/frame/group_by/aggregations/mod.rs:895-904 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:988-997 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1053-1062 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:895\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73c742df773d258006e1c2df1730af0d2f64a5de89657388d8b0b90cc0394ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-core/src/utils/supertype.rs:36-46 | crates/polars-core/src/utils/supertype.rs:52-61 | crates/polars-core/src/utils/supertype.rs:67-76 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/utils/supertype.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f433497855431665507e4198d3d1fd758870a1260454e76660559a42a74f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-ops/src/series/ops/fused.rs:13-24 | crates/polars-ops/src/series/ops/fused.rs:64-75 | crates/polars-ops/src/series/ops/fused.rs:114-125 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/fused.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69b33bbccbff34864fedf18abaec0922a886c7b385c664ed6f3707eb68a14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:428-437 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:447-456 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:469-478 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:428\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52972c4874493c590ccf002d1ba7cba9a6522d172eb14da1b36dca3c025543c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/schema.rs:629-638 | crates/polars-plan/src/plans/aexpr/schema.rs:704-713 | crates/polars-plan/src/plans/aexpr/schema.rs:782-791 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:629\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1122a6a18d729df56821b52fab1eef56105a9b9ded8f654026614334d2f198bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-python/src/series/construction.rs:99-108 | crates/polars-python/src/series/construction.rs:117-126 | crates/polars-python/src/series/construction.rs:135-144 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/construction.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d5ff1f76058edb13039a7325031418e4e995b857457928db022d0111633e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/polars-stream/src/physical_plan/lower_expr.rs:1066-1074 | crates/polars-stream/src/physical_plan/lower_expr.rs:1250-1259 | crates/polars-stream/src/physical_plan/lower_expr.rs:1422-1430 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1066\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ca0c66d75dfedce3eb01ed7b5867499a4ffae7b2ab7fa8344997cc95083c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-compute/src/comparisons/array.rs:43-53 | crates/polars-compute/src/comparisons/array.rs:69-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/comparisons/array.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/array.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"71488fa3407bf79bc7b183c7473117d2f31c4d8b970addc70de843b091dce29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-compute/src/rolling/min_by_max_by.rs:38-47 | crates/polars-compute/src/rolling/min_by_max_by.rs:65-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/rolling/min_by_max_by.rs:38\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/min_by_max_by.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f658ded72c488558eec774de652b29bf93461377b0aa2eeab8d4bddb820a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/chunked_array/comparison/categorical.rs:111-120 | crates/polars-core/src/chunked_array/comparison/categorical.rs:148-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/comparison/categorical.rs:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/categorical.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae27ac796f6b52b9e84df51978e68320f6885e600bd1c564af547c97b468c80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/chunked_array/comparison/mod.rs:723-732 | crates/polars-core/src/chunked_array/comparison/mod.rs:957-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/comparison/mod.rs:723\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/comparison/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ddb357ca77821f6b8a00978c2567384f65c835b28603c092925cdee55eadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/chunked_array/object/iterator.rs:30-39 | crates/polars-core/src/chunked_array/object/iterator.rs:119-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 \u0060crates/polars-core/src/chunked_array/object/iterator.rs:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/iterator.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31561dd3058866d94ac7def79c3d411754f6134250969a410f6d6bd5309f74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/rolling_window.rs:144-153 | crates/polars-core/src/chunked_array/ops/rolling_window.rs:156-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ops/rolling_window.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":"crates/polars-core/src/chunked_array/ops/rolling_window.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"710939ec30ee42fac4ff6865b7a4dbe76640a88013c780fea47e5ad2f8ac0566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/zip.rs:121-129 | crates/polars-core/src/chunked_array/ops/zip.rs:139-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ops/zip.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/zip.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2434842ef1f15ac26d39166209082c32dbe2879abefa02c967362b304ae10765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:20-29 | crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:92-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/agg_list.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2eb7082fafa78a9386c58d89631bd3770368c3be6c5d75205fc9aa2ff69188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/series/any_value.rs:394-403 | crates/polars-core/src/series/any_value.rs:405-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cddd7e912c1ee43647c542c2024e3b340bc566a9471e208c1dd2d2fd80cba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/series/arithmetic/list.rs:622-631 | crates/polars-core/src/series/arithmetic/list.rs:721-730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/list.rs:622\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"443371bfd9e2eb4d190ef72a4dfe50ffd87368d1053b5cf845991ba5ee3ba9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/series/arithmetic/list.rs:618-627 | crates/polars-core/src/series/arithmetic/list.rs:761-770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/list.rs:618\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a47d171b23f2375922187838819c6f23241e116eca490a9dedd5e884b645e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:908-917 | crates/polars-expr/src/dispatch/groups_dispatch.rs:965-974 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/groups_dispatch.rs:908\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64c7c2ac7477a2560f7d40ced9d5f12d922b07f15453c194d02cf7d412ec199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:682-691 | crates/polars-expr/src/expressions/structeval.rs:349-358 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/expressions/apply.rs\u0060 and \u0060crates/polars-expr/src/expressions/structeval.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/polars-expr/src/expressions/apply.rs:682\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8321f703499126ebe529a9a8dee709b52a44915a9c9ee3ae86b86e7cfe8a389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-expr/src/groups/single_key.rs:81-90 | crates/polars-expr/src/idx_table/single_key.rs:248-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/groups/single_key.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/single_key.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2c13de6bfbd445713d57adfaf711452ea419bd8d2a340801a48a60a4bc74b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-io/src/catalog/unity/schema.rs:289-298 | crates/polars-io/src/catalog/unity/schema.rs:429-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/catalog/unity/schema.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91fe93e582b72ad03f25ac9d58317667bdd1b6e95ab7d18a349890690b959f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-json/src/json/write/serialize.rs:504-515 | crates/polars-json/src/json/write/serialize.rs:518-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d47b9fb4b9a4e7323c727d94fc77ebff22ad71c6e38afce54bf9b6c0a54f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-mem-engine/src/scan_predicate/functions.rs:91-100 | crates/polars-mem-engine/src/scan_predicate/functions.rs:111-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20448e2b1906119b5904f19a5aecd17e3ed55c9b15093c67e197be02ddcd80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:534-543 | crates/polars-ops/src/chunked_array/gather/chunked.rs:577-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ffb73f8ed1f6aff0395fe57c820095ed9f7dd8e0672e1ae9fcc47be2064f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:551-560 | crates/polars-ops/src/chunked_array/gather/chunked.rs:590-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:551\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b7676074a59117cb06cb59c57b1e43f676a176a8056dfb5cc293f7e6cd2b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:583-592 | crates/polars-ops/src/chunked_array/gather/chunked.rs:801-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:583\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c44e62f7b806062a6fa196f7efe4d0b4ee7c4da8a6ca7561727de84a1aa83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:765-774 | crates/polars-ops/src/chunked_array/gather/chunked.rs:812-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:765\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a4a090df2cfe26e4d541afeffc2c270767781a9e828f8402dd5ba3f3cc8aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/sum_mean.rs:88-97 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:108-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/sum_mean.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sum_mean.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0058f46dcf5370c2c05431d230d4cd9db033735f1c7603bcb2b249920ee51396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/find_many.rs:179-187 | crates/polars-ops/src/chunked_array/strings/find_many.rs:279-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/find_many.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce23da2ec28d4ae457cbe2ed69f6c3d84bc5b3ac6c77f5e6077200606c8d5c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): crates/polars-ops/src/series/ops/clip.rs:61-64 | crates/polars-ops/src/series/ops/clip.rs:91-100 | crates/polars-ops/src/series/ops/clip.rs:127-136 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/clip.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-ops/src/series/ops/clip.rs:100\u0060 calls \u0060dtype\u0060 and \u0060crates/polars-ops/src/series/ops/clip.rs:64\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a18323c5303ec3aaa25e4f45c76cc12aaf5949284d04c966cf72a3c3e1ead0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/series/ops/cut.rs:152-161 | crates/polars-ops/src/series/ops/cut.rs:210-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cut.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f219c2e46dbb831b809b76ce44ada09cfe9009ae6905702e81ba6f2f49e288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-ops/src/series/ops/interpolation/interpolate.rs:84-92 | crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:140-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/interpolation/interpolate.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f008db41e9bf552412fe79ce3dc68f56d794677d1004971d8ad01cd7b573307a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:153-162 | crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:255-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e8b57a3ec48cceb4e2f6ac78d64c943d1fbc76125fc72938b9ff99d677329e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:702-710 | crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:718-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:718\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfa3953dd1e33d43465d2068a71dbf1876578309fb992c97816d8012a418e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs:197-206 | crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:267-276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs:194\u0060 calls \u0060fast_iter_u56\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs:265\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a3a3d2d30eeb375d9799add826cd08df4601051387dcc01a55592f90b67631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs:31-40 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs:42-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 \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs:31\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40e9d3e0fe8a34737ed503ba669033c7dd5350795db5611d7919991b992f1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/nested.rs:31-40 | crates/polars-parquet/src/arrow/read/deserialize/nested.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/nested.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c64269edf6c275f80c547576b6a31576ba43e0c0d52e92924183c849249ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:683-693 | crates/polars-parquet/src/arrow/write/mod.rs:750-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 \u0060crates/polars-parquet/src/arrow/write/mod.rs:683\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aead40378addfb57f0ab74d4f46bd35e8f3662e9b8e3b661056c2cca7da1527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/parquet/encoding/delta_bitpacked/decoder.rs:433-443 | crates/polars-parquet/src/parquet/encoding/delta_bitpacked/decoder.rs:489-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/encoding/delta_bitpacked/decoder.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/delta_bitpacked/decoder.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"29663732f16879a761c72b9fe4e796c7026c796478a5ef391b90412f3a39396a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:94-110 | crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:151-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encoding/hybrid_rle/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c7d7883b4a5d0214ada4ce5f205c5ff7eab5fd4502aeeedf417b094e934434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs:178-187 | crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs:237-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":"crates/polars-parquet/src/parquet/handwritten_thrift/parquet_thrift.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735804cf05a023065a14a05eb5e5fa534f9b7f495e1c7f494b20c205a87a764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): crates/polars-parquet/src/parquet/write/compression.rs:153-162 | crates/polars-parquet/src/parquet/write/compression.rs:178-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/compression.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ddfec900431d12709167734cd511ee55a77f5cb80d06a5e73a5fb97fb0c721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/strings.rs:167-176 | crates/polars-plan/src/plans/aexpr/function_expr/strings.rs:355-364 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/strings.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/strings.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cafb602dd60687979a4b5bc07d1ce47715e077d34caf51b4442bd4bcb71ee74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs:606-615 | crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs:621-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f6cbf438fa755b5511f542cb00a54fcc2ba7cf8767677e6b3720d9500a6247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:867-876 | crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:1454-1464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:867\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"32caac21719680ff35d877c85a11f59bdb3afec20dbdeede88d7279430c5e26f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs:171-180 | crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs:193-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs:171\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a4073a490d47bd22fde75fc6769754971fccf21d58013eea1fae76f56798b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/plans/to_description.rs:413-422 | crates/polars-stream/src/physical_plan/to_description.rs:357-366 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/plans/to_description.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_description.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac2e402d65ced01729111d137967055f2e682486dbfe34f008668d6faa24c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-python/src/conversion/mod.rs:687-696 | crates/polars-python/src/interop/arrow/mod.rs:19-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/conversion/mod.rs:687\u0060 it does not close everything it opens, so those exact 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 \u0060schema_object\u0060 to \u0060Borrowed\u003C\u0027a, \u0027py, PyAny\u003E\u0060 in one and \u0060Bound\u003CPyAny\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b4015f1da9dada1aa9c8b30b00508351dccb6ea7c0ab94fe3a5ce53e16f175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-python/src/conversion/mod.rs:1292-1301 | pyo3-polars/pyo3-polars/src/types.rs:96-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/mod.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49b2f574b2c4aeca560332ea791e474b8497e9573172c6ab968517f0507b113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-row/src/variable/no_order.rs:238-247 | crates/polars-row/src/variable/utf8.rs:287-296 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/variable/no_order.rs:238\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3384b814666f6a2c6bce4f83480e45f89c0663ffedfd5e4a6fd37b2ad6b01b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-sql/src/lateral.rs:421-430 | crates/polars-sql/src/subquery_group_by.rs:286-295 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lateral.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6ba8ccab905f07e2725c3908110f172a9830209dc392a7be0b3dc6ea3072a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-stream/src/nodes/backward_fill.rs:105-113 | crates/polars-stream/src/nodes/interpolate.rs:117-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/backward_fill.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a33bb2acd9b1b0573c1aa0da6d603688c307686be00c648514ef82b3d879b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/external_python/mod.rs:380-389 | crates/polars-stream/src/nodes/io_sources/external_python/mod.rs:424-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/external_python/mod.rs:380\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/external_python/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfe0a34da3bfc59cc273521f5d8693157cc1c744142c51252cfd9952869a7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/builder.rs:130-138 | crates/polars-stream/src/nodes/io_sources/parquet/builder.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 \u0060crates/polars-stream/src/nodes/io_sources/ipc/builder.rs:130\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/builder.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2880e9dc619e1007d08fe4f027c74a84937964364f9e8cc9b264fa6529f660d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:656-665 | crates/polars-stream/src/nodes/io_sources/parquet/init.rs:328-337 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/ipc/mod.rs:656\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6e6c6a54dcc0037351741cf9358464f57a5cb33bc3af815cb03aae23b24b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:645-652 | crates/polars-stream/src/physical_plan/lower_expr.rs:685-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c602d50976d5f58ccb23700a011b214f4f607fa44dce0e398d7c873c969db36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/polars-core/src/chunked_array/ops/arity.rs:864-872 | crates/polars-core/src/chunked_array/ops/arity.rs:877-885 | crates/polars-core/src/chunked_array/ops/arity.rs:914-922 | crates/polars-core/src/chunked_array/ops/arity.rs:927-935 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ops/arity.rs:864\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"19736b319dbcf62ea3d229153b4a3c5f98074e7854f2e387edc43d96c05b0f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/polars-expr/src/idx_table/binview.rs:240-248 | crates/polars-expr/src/idx_table/row_encoded.rs:147-155 | crates/polars-expr/src/idx_table/row_encoded.rs:186-194 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/idx_table/binview.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3667b6f69f5a5e384ac265f6fa87210006a0c59311d78f947347bcd08b457494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/polars-mem-engine/src/executors/hconcat.rs:43-51 | crates/polars-mem-engine/src/executors/union.rs:93-101 | crates/polars-mem-engine/src/planner/lp.rs:116-124 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/hconcat.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/union.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/executors/hconcat.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/hconcat.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f78b125959883134d5c98263e4ae6d71d3ed9af5478af6a71e9049fe0892e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 4): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:30-38 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:149-151 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:246-254 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:371-379 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:39\u0060 calls \u0060binary\u0060, \u0060unwrap\u0060 and \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:152\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3b15a6f293c74640dcd9027f44802fadb92f4bf2395455170035496d9ce748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs:37-45 | crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs:53-61 | crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:54-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/binary/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cd6fd04496eb13a18e7042dfb61270b85fbd3ca8ce65b69650ad9a6e94dc3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/filter_constraint.rs:902-910 | crates/polars-plan/src/plans/aexpr/filter_constraint.rs:1113-1121 | crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:2837-2845 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18520ddfb69db70db5856c751a17a3df970f83099885889f7396dd42b3a8e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-compute/src/min_max/simd.rs:40-48 | crates/polars-compute/src/min_max/simd.rs:92-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/min_max/simd.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":"crates/polars-compute/src/min_max/simd.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7074b46919b58deac9e17bc6549db4cbf1b4690438269b5f827de2dc403e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-compute/src/moment.rs:351-359 | crates/polars-compute/src/moment.rs:494-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e934a06494c1286bc98e3ee99a78fc211a2948f51c611ae651e9e5a4c41446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:493-505 | crates/polars-compute/src/unique/distinct.rs:697-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:493\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"795231c778452ba66e09b1fd95b02b9b8cc2449d9914ad4a28934ba31faea4c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:544-555 | crates/polars-compute/src/unique/distinct.rs:729-740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1367c476aeb0505bae6539d66ba5e3f4090cf96d7fcc61436f365e99f2de7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/chunked_array/cast.rs:620-628 | crates/polars-core/src/chunked_array/cast.rs:645-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"123429151fa5e2a8ab898271ab2944afb736ac0d06d9444c70d7f0960c26ddf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-core/src/chunked_array/ndarray.rs:271-279 | crates/polars-core/src/chunked_array/ndarray.rs:307-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ndarray.rs:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ndarray.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5dad342c256a7b6b57d68740e03baeee844cf36aaaf5ae4e30a0bde9b39251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/arity.rs:258-266 | crates/polars-core/src/chunked_array/ops/arity.rs:335-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/ops/arity.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c25bbba1a14a2ccb5ce3f6b3a882f847a044e0a34679ac7956d00aee93ecdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:46-54 | crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:111-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/agg_list.rs:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/agg_list.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a915c3f763bdbbe876d0640a29ac894e908ced7f0b5ed02544f599d655b35341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:1279-1287 | crates/polars-core/src/frame/mod.rs:1331-1339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/mod.rs:1279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d74c69c20e44017187d44392baccbee40c02d53de05a44c028720d340ecde2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:177-186 | crates/polars-core/src/series/arithmetic/list.rs:258-267 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab508f627ec57140fd61e6fa516f9c066735712fe3de68a34d9d2d36161be4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:520-528 | crates/polars-core/src/series/arithmetic/fixed_size_list.rs:570-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68d1bcd2846ee1e3441c0170daae8ab4fce6eff2ceef3df23214706b0c7c7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-core/src/series/mod.rs:564-573 | crates/polars-core/src/series/mod.rs:576-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd48fc6744500517ba3922f8dc8b984082096d42dfd5975361ba4af5246ef96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/utils/mod.rs:939-947 | crates/polars-core/src/utils/mod.rs:995-1003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/utils/mod.rs:939\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"156db193212cad3ace23f9abd4c4926dfef27002aaa4d0f5fcfb76493027dad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/dispatch/range/datetime_range.rs:27-35 | crates/polars-expr/src/dispatch/range/datetime_range.rs:49-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/range/datetime_range.rs:27\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/datetime_range.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"197654a04a72264826ab13c1dc3b10bfe75a18fb86a7ff3c3ebb9c730e7cad28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:611-619 | crates/polars-expr/src/expressions/binary.rs:392-400 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c800f4b50a8b7863c4615737a47da75215cf59b8f6c9b6c4b46952817592a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/expressions/group_iter.rs:95-103 | crates/polars-expr/src/expressions/group_iter.rs:125-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 \u0060crates/polars-expr/src/expressions/group_iter.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn iter_groups_lazy(\u0026mut\u0060 in one and \u0060super) fn par_iter_groups_lazy( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/group_iter.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac898f33cd2ec03b8090136ec554754233485edf6028e98c5cad805b6912bfce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-expr/src/hot_groups/binview.rs:149-156 | crates/polars-expr/src/hot_groups/binview.rs:162-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/hot_groups/binview.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/hot_groups/binview.rs:158\u0060 calls \u0060push_g\u0060, \u0060insert_null\u0060 and \u0060crates/polars-expr/src/hot_groups/binview.rs:170\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/binview.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02e422969d1df85d49d12190c0ca733f794bf3be3ab8ae0aff91b65e45fa96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/hot_groups/fixed_index_table.rs:132-140 | crates/polars-expr/src/hot_groups/fixed_index_table.rs:143-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/fixed_index_table.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db22bc9a6c59aa27655f9aa97d7f4c9f2e72d111db76990e4de9ce17183c0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:428-436 | crates/polars-expr/src/reduce/mod.rs:692-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586897a76dc4b94a5e7935d06c6e2b87f8785febed6d9b5b2a1a47bd48c28a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-io/src/csv/read/builder.rs:140-148 | crates/polars-io/src/csv/read/builder.rs:407-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/builder.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea09350d550f8d17ff9835c7b17b73f0bc9a742335e6b57a8e11ecfdb6ce461c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-io/src/json/mod.rs:148-156 | crates/polars-io/src/json/mod.rs:193-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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 \u0060df\u0060 to \u0060\u0026mut DataFrame\u0060 in one and \u0060\u0026DataFrame\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/json/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedde5e961fb9efe0736079f9036232c11ee587f9b600a1b2360ae7bf464eb00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-json/src/json/write/serialize.rs:202-210 | crates/polars-json/src/json/write/serialize.rs:217-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4530ce58389cca1d54e5226c8fcc09a61cd0b03f05f6f965f790b1076c0cf955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-mem-engine/src/executors/group_by_dynamic.rs:74-82 | crates/polars-mem-engine/src/executors/group_by_rolling.rs:106-114 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/group_by_dynamic.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/group_by_rolling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/executors/group_by_dynamic.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":"crates/polars-mem-engine/src/executors/group_by_dynamic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a123ca726fff4fdaee0f636b23d3fb85ccfe2819447ecee3715e914b31937b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-mem-engine/src/executors/scan/python_scan.rs:75-83 | crates/polars-stream/src/physical_plan/to_graph.rs:1940-1948 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/executors/scan/python_scan.rs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/scan/python_scan.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba8cc7bd6f3f872b33f0113da7ae1bbeb6d36c43683e2b9aebe6f607e3fe280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ooc/src/memory_manager.rs:314-322 | crates/polars-ooc/src/memory_manager.rs:404-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ooc/src/memory_manager.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191e35698d37110921e132e0ee3189e4934bcebc516b5c02d5138365adf7a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:872-880 | crates/polars-ops/src/chunked_array/gather/chunked.rs:921-929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8bf6a806f34a8d0fadbfd78eefec0ba636452fb155d54a65eb2485d4a47a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/namespace.rs:448-456 | crates/polars-ops/src/chunked_array/list/namespace.rs:522-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/namespace.rs:448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"295d81ab84c959a89a31039a4f408f8df280d037ecfa54b39aba088219d6edd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20139 lines \u00D7 4): crates/polars-core/src/frame/group_by/aggregations/mod.rs:363-365 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1138-1139 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:98-106 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:165-173 \u2014 before extracting anything, compare \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1139\u0060 calls \u0060values\u0060, \u0060as_slice\u0060 and \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:365\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273e4cb4f69a49ad8644ad432bb0068d3a9d589c84967a6447ecdbf2891d43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/split.rs:181-189 | crates/polars-ops/src/chunked_array/strings/split.rs:325-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/split.rs:181\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/split.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ddb1d470389bb97505b3e731f84a8e772b50cf722e242668bb7c56c3b6b96c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs:160-168 | crates/polars-ops/src/frame/join/hash_join/single_keys_semi_anti.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_left.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"37466a62bcaac30e14c83b1e362d57cdc3745fbb0ee3b1b0a83351fd74d8f2bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/frame/join/iejoin/mod.rs:769-777 | crates/polars-ops/src/frame/join/iejoin/mod.rs:779-787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/iejoin/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"665a3ce010764f6850c2ccb8d051d6dfc417e64682f297eccc7ca9888ea80001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/series/ops/concat_arr.rs:45-53 | crates/polars-ops/src/series/ops/concat_list.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/concat_arr.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca431e1d8508ed812bc0a5be2e9c0d7fa9770301ed7a7e2612e3386e5cdb3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:365-373 | crates/polars-ops/src/series/ops/is_in/mod.rs:452-460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:365\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e12b66ec9d1815d7d15e6ed156aec0da516db22cd31143250fa89423887bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:385-393 | crates/polars-ops/src/series/ops/is_in/mod.rs:472-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:385\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bee558e336f95480089be9a65d8f176531a487635296ee85a91e381e99e3d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/series/ops/is_in/mod.rs:684-692 | crates/polars-ops/src/series/ops/is_in/mod.rs:696-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.rs:684\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3de1515d969a8513bf5c38f16011c27f0fd43a592b0be88091846f263dd529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/series/ops/rolling.rs:20-28 | crates/polars-ops/src/series/ops/rolling.rs:84-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/rolling.rs:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rolling.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b59558168f5b5ed5d53105f85a4da956a51f00ef38bf86e3b2f2cd4b3070040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:237-245 | crates/polars-parquet/src/arrow/write/mod.rs:247-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b697f62bcfc559778ae0d12a5b9b24d219b5b2ab6a12f4ec06a23be9d9619cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:465-473 | crates/polars-parquet/src/arrow/write/mod.rs:899-907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da407541cd0eda9310ea45973a8495ced2081700e03f34d2b0c382896354f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:651-658 | crates/polars-parquet/src/arrow/write/mod.rs:750-758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:651\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba8e84b670aec7fa9e7b6de7085c483faccaabc58ef00081162ca34e2e63a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:943-951 | crates/polars-parquet/src/arrow/write/mod.rs:1005-1013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"834a82d89d1fe556071f54bc5ba8f7ffebc3dec7ae4619a78f221ce86a67eb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:970-978 | crates/polars-parquet/src/arrow/write/mod.rs:1031-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:970\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ed7ce2b98e8f9ebcde6a9d51934cef991d33ddb60ee30e54f54fa2ebf89bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:375-383 | crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:459-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a2b41e2d043bc57536750ebfd8c20caf99ab10d6ee0ea9f4901fc248793b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/mod.rs:1012-1020 | crates/polars-plan/src/plans/aexpr/function_expr/mod.rs:1033-1041 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/function_expr/mod.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 515 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e6a82d3a173de7c8f8c17c91474e47eb44b2de19428bc29af5df2af329fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/function_expr/list.rs:109-117 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:296-304 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/list.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88aab2cc80cc1777971d612b915ba2f56812dc263daebf62d0bba437d0a1407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:1966-1974 | crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:2005-2013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:1966\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb24cd53789629d4bf15274f77b909afdbd0b4035717db42b1faa73a57b9294d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1153-1161 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1244-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1153\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1253\u0060 calls \u0060try_get_supertype\u0060, \u0060temporal_range_output_type\u0060 and \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1162\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0210e8cf2c6289213181d357a414d231e4d98f83257fc93371968ef086a6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1175-1183 | crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1270-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1175\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1269\u0060 calls \u0060temporal_range_output_type\u0060, \u0060clone\u0060 and \u0060crates/polars-plan/src/plans/conversion/type_coercion/mod.rs:1174\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf5a3f51ebae06232a2649fd0c48e3fe3bd6dd699c1ffab2570f559d171c4e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/expr_ir.rs:30-38 | crates/polars-plan/src/plans/expr_ir.rs:45-53 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/expr_ir.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bdc71b0276103c664dc85115ea3fa389c5c5462342d6159ec104fee8b83727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs:130-138 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs:300-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b354adef92ee469054c9ed80c65f3538ea86f79ae35ece4071c697bbd893446d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:930-938 | crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:945-953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:930\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f47862d1a08a851b430f43009bcdf4b148501ee6eb6d94558d9d302b20f976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/options.rs:585-593 | crates/polars-plan/src/plans/options.rs:634-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 \u0060crates/polars-plan/src/plans/options.rs:585\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e101b3382efff2f51eb9ba423e6074e49a40ca6a471590430d6d2805e7548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/plans/options.rs:729-737 | crates/polars-plan/src/plans/options.rs:740-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/options.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc5d252bc7542467040697dfd844bb2abc3a4f6460cac0f770c9d498a9ae36f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-plan/src/plans/python/pyarrow.rs:286-293 | crates/polars-plan/src/plans/python/pyarrow.rs:666-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/python/pyarrow.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc3cee9a45b7734ffe88276f613494c266883e6ad09b82dd78d65de8380ab20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-sql/src/context.rs:964-973 | crates/polars-sql/src/context.rs:1052-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:964\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7355a1fcf3476424754d4d57102b4b82459f796d95c3dcf6a364f8a759d2789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs:158-166 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs:241-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb038388086c64ba47bc7b666ae673409dcd1cd908765f7d6e78d2b87041279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs:531-541 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs:543-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102f69f2a70e97bd07cee9e8e2047e3f9c71d1f15c1bba321fd4ace84a4286b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs:70-78 | crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs:202-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b203ae2e09f1c77401921109551de63e1c302d8f4f3922518b2689e75dfaa60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:326-334 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:253-261 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs:326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"559cba2ce9db07fe12463de539063e3242900fbd9a11f9368b3466a7e91f9a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:1447-1454 | crates/polars-stream/src/physical_plan/lower_expr.rs:1494-1502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1447\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e2933e5ffadfac27b17180814b1c139d514defd71afb9747cc3d5d79620fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_group_by.rs:223-231 | crates/polars-stream/src/physical_plan/lower_group_by.rs:350-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"88010da38dd2d9521ee69731672a9b37f329ade1e1110ec733ad524ea4a57adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:267-281 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:297-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc233b2b12ef3e49a80e28918bb4d5b93afaa5eec4f2d875d20d001e5954d758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-utils/src/arc.rs:5-13 | crates/polars-utils/src/arc.rs:25-33 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-utils/src/arc.rs:5\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/arc.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a250149f3ac24a48481969bb4f882d3e46fca715209c6ddd25fc8a1ba10854cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/polars-io/src/csv/read/parser.rs:578-585 | crates/polars-io/src/csv/read/parser.rs:914-921 | crates/polars-io/src/csv/read/splitfields.rs:292-299 | crates/polars-io/src/csv/read/splitfields.rs:383-390 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/parser.rs:578\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa8f2c0cdde2d06afe7ebf072ed041f6e9bd039541926106f40c1591f684ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/polars-ops/src/chunked_array/gather/chunked.rs:742-749 | crates/polars-ops/src/chunked_array/gather/chunked.rs:766-773 | crates/polars-ops/src/chunked_array/gather/chunked.rs:793-800 | crates/polars-ops/src/chunked_array/gather/chunked.rs:813-820 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2886eb8dfa280833da8be1884859528b2af2640c9a38d18cbce853ac5f7708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/polars-parquet/src/arrow/read/deserialize/categorical.rs:266-273 | crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs:227-234 | crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs:201-208 | crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs:315-322 \u2014 before extracting anything, compare \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/categorical.rs:266\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/categorical.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c40b5214999845b819c65f28fea80bf2ba059c4f58620363065e59dbed41274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/polars-stream/src/nodes/forward_fill.rs:65-72 | crates/polars-stream/src/nodes/gather_every.rs:57-64 | crates/polars-stream/src/nodes/sorted_unique.rs:78-85 | crates/polars-stream/src/nodes/with_row_index.rs:53-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 all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/forward_fill.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a767db567566f233fb293c87e90ba948008f729261484f8c09b71094af037267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/polars-core/src/frame/group_by/aggregations/mod.rs:560-567 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:741-748 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1015-1022 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ceb6ad58778c3796a9b045fe4bc1a49f35524947c09139bf90728d49e1373b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/polars-expr/src/expressions/slice.rs:166-172 | crates/polars-expr/src/expressions/slice.rs:209-215 | crates/polars-expr/src/expressions/slice.rs:252-259 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65cfd7d46f4b2831a6b3c18166137096c8c17126db44c30df2e86a0aa2ab1ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/polars-stream/src/physical_plan/to_graph.rs:1699-1706 | crates/polars-stream/src/physical_plan/to_graph.rs:1735-1742 | crates/polars-stream/src/physical_plan/to_graph.rs:1768-1775 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1699\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4956a8827c0ab6381224f1d450abf2459edc7899917250ed94fff843740414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): docs/source/src/rust/user-guide/concepts/expressions.rs:80-88 | docs/source/src/rust/user-guide/concepts/expressions.rs:93-101 | docs/source/src/rust/user-guide/getting-started.rs:110-117 \u2014 before extracting anything, compare \u0060docs/source/src/rust/user-guide/concepts/expressions.rs\u0060 and \u0060docs/source/src/rust/user-guide/getting-started.rs\u0060 as WHOLE FILES: this scan already matched 5 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/concepts/expressions.rs:80\u0060 it begins part-way through the construct above it, so those exact 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":"docs/source/src/rust/user-guide/concepts/expressions.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec3f75c5c7f75dbfd76c4adc600f0a4ef821d52680461de7fa3eb7dc87e0803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): docs/source/src/rust/user-guide/transformations/time-series/resampling.rs:8-15 | docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:46-53 | docs/source/src/rust/user-guide/transformations/time-series/rolling.rs:105-112 \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 \u0060docs/source/src/rust/user-guide/transformations/time-series/resampling.rs:8\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/time-series/resampling.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"52af1040f29ffb6f4c09b5774983ea5cfa40ad88eff4ddb4603095e76b9594f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/arithmetic/mod.rs:197-204 | crates/polars-compute/src/cast/primitive_to.rs:126-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/arithmetic/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b70d59d6e29424604342ea7d146441d14e5947d01e327653cce7ae1ff73192e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/comparisons/array.rs:95-102 | crates/polars-compute/src/comparisons/array.rs:116-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/comparisons/array.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/array.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd39a4d59f194bcfbf59bc37dc8a0786e478669694fb76f12f20ea5cb5989bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/moment.rs:142-149 | crates/polars-compute/src/moment.rs:210-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a04069a8970e87f8ac424d43981bf4dca5b532c4773dd946476a68ca0213bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-compute/src/moment.rs:332-347 | crates/polars-compute/src/moment.rs:465-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"857d28620cc6e2fd33d5a43e0b57a5042f9cb2ec0d76e452d2126c0970418ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/rolling/no_nulls/rank.rs:66-73 | crates/polars-compute/src/rolling/nulls/rank.rs:60-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/rolling/no_nulls/rank.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-compute/src/rolling/nulls/rank.rs:68\u0060 calls \u0060get\u0060, \u0060unwrap\u0060 and \u0060crates/polars-compute/src/rolling/no_nulls/rank.rs:74\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/no_nulls/rank.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0d8c04cee8c6585858bcfd348ec271ed96e8eb426327cdb5b04f11fcab2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/unique/primitive.rs:144-151 | crates/polars-compute/src/unique/primitive.rs:158-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/primitive.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/primitive.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb74605ec33291fe28c3b8f4f1aba18219c88b9474a68066c004d4ad1b4a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/chunkops.rs:143-150 | crates/polars-core/src/series/implementations/null.rs:62-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/chunkops.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45c2f4feac2f7e885c8217956cda4cccf8fa491640a26a9e6e1378b4d350b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:415-422 | crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:473-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/dispatch.rs:415\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9b2ac355418b98d7821dde57576d16ff4d12d81feb0823cb5ef49b2c0d2bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:544-551 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:173-181 \u2014 before extracting anything, compare \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d68fd3dc9ca6fcb08f02b3571cd7a9934d7f038c6caea47554adc7f62155b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:725-732 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:106-114 \u2014 before extracting anything, compare \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:725\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d472c52dd6ae461c0b2ab333e0eb33890f720f30ab57aa7a67d7047532bb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1338-1345 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1383-1390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d4cd13638b6c46c892ab6da27606cb7b6b12ed060c8db9b7e48d7cadca0c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-core/src/frame/row/av_buffer.rs:263-269 | crates/polars-core/src/frame/row/av_buffer.rs:777-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/row/av_buffer.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/av_buffer.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf5622a79b6cb347ea12d14920629792b5df4896c5944fedad9ffeb1c1754b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/series/any_value.rs:369-376 | crates/polars-core/src/series/any_value.rs:384-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/any_value.rs:369\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2df2d2f1939635256d8782d20826a929dad43c4d721e406f8b6c9fc1f385de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/series/arithmetic/borrowed.rs:453-460 | crates/polars-core/src/series/arithmetic/borrowed.rs:469-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/borrowed.rs:453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7852cd93d0262c37e91d405afebdac83c807ff2e4a648f78556c9239a4948e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:385-393 | crates/polars-core/src/series/arithmetic/list.rs:382-389 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:385\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6011277e7cda7a6242ac693d7a9a2fd654f3437732536c9febbdd2734a39b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:90-97 | crates/polars-expr/src/dispatch/groups_dispatch.rs:147-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/groups_dispatch.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f84ba41b6802daa88f7844ee4ae018da33932aea257b009219e23dbd9ea09f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-expr/src/dispatch/strings.rs:369-376 | crates/polars-expr/src/dispatch/strings.rs:391-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/strings.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"279af8876a4c6c664c1ebabe05b6e20abc2f22b73c6c0ce9d77f095def766118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/expressions/slice.rs:177-184 | crates/polars-expr/src/expressions/slice.rs:268-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/slice.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-expr/src/expressions/slice.rs:263\u0060 calls \u0060check_argument\u0060, \u0060cast\u0060, \u0060i64\u0060 and \u0060crates/polars-expr/src/expressions/slice.rs:175\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4078f84e97ce6554b0716abdd2bb1c82b9437100c57243c2190896b836f30c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-expr/src/groups/row_encoded.rs:129-145 | crates/polars-expr/src/groups/row_encoded.rs:180-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/groups/row_encoded.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":"crates/polars-expr/src/groups/row_encoded.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ea3736f90916a1dceb623d97d96cf0d8bae79775b4c0a4b230a7327a7944bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-expr/src/groups/single_key.rs:173-179 | crates/polars-expr/src/hot_groups/single_key.rs: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/groups/single_key.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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 \u0060keys\u0060 to \u0060Vec\u003CK\u003E\u0060 in one and \u0060Vec\u003CT::Physical\u003C\u0027static\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":"crates/polars-expr/src/groups/single_key.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"14947f68beae462051e2d097833a832600ddd91e371b2b30580037c88f873eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/hot_groups/binview.rs:135-142 | crates/polars-expr/src/hot_groups/single_key.rs:130-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/binview.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c80da98347980b4a003bed30b1269fa828a2c76e3389754ef63ff7c1e84335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/idx_table/binview.rs:222-229 | crates/polars-expr/src/idx_table/binview.rs:239-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":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7968d4c1c6734976dc296ea057e7fa84055d27e319fc38f3a8cfe17efbdd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-expr/src/planner.rs:607-613 | crates/polars-expr/src/planner.rs:640-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/planner.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed083578c03cd13fa36ca14d4ecc1b7bc772669f1e84c1f59b54a60c21aa084e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/reduce/first_last.rs:33-40 | crates/polars-expr/src/reduce/first_last_nonnull.rs:25-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/first_last.rs:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4acbbb125602b28bb108782d5c275efdf0c2b4c3c4b16a979ea5e11ed79ba4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/reduce/first_last.rs:496-504 | crates/polars-expr/src/reduce/first_last_nonnull.rs:483-491 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/first_last.rs:496\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22a6d1805349d00c68826aaa7ed61eb5372b914e92e28da0b1d13d44e8d8077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/reduce/implode.rs:92-99 | crates/polars-expr/src/reduce/implode.rs:162-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/implode.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa5756146ab4ddd0b24c0f6a4b4bb7f9a0daca3a24875caba9ac9adc41cc997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-io/src/predicates.rs:445-452 | crates/polars-io/src/predicates.rs:459-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8724a1fdf3934490efd7c71d2e961677f7ca75888c1845596c5b96b6992781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/count.rs:11-18 | crates/polars-ops/src/chunked_array/list/count.rs:45-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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 \u0060ca\u0060 to \u0060\u0026ArrayChunked\u0060 in one and \u0060\u0026ListChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/count.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89480a3eb12f6c3bd2648bb27f015068f811453b8f1491a68051ac4c6ed46cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/dispersion.rs:12-22 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:232-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs:12\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52e0d79891cb4f13079d582094ab81c0c6380ac94e4cda9122746b64c1ffc5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/dispersion.rs:47-57 | crates/polars-ops/src/chunked_array/list/dispersion.rs:14-24 \u2014 \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs:47\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e902fa198090873f7a45dc3c32343777d72d51cae60b1340a5651d4f16a490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/dispersion.rs:82-100 | crates/polars-ops/src/chunked_array/list/dispersion.rs:59-77 \u2014 \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"126afc4d6c8ec87afd9353d073ce87814289a0d4cc984a98cf7425c39f06a7ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/chunked_array/top_k.rs:70-77 | crates/polars-ops/src/chunked_array/top_k.rs:105-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ca\u0060 to \u0060\u0026ChunkedArray\u003CBooleanType\u003E\u0060 in one and \u0060\u0026ChunkedArray\u003CBinaryType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/top_k.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d6b461315d7fe56a9968524190b8516d0bbb2cf6151d2dc09341e1b45003c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/frame/join/merge_sorted.rs:129-136 | crates/polars-ops/src/frame/join/merge_sorted.rs:140-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 \u0060crates/polars-ops/src/frame/join/merge_sorted.rs:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_sorted.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"893acf6e04e8bac73db2f2140e366dd9c144daf046f016e063e22b91e1019ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/series/ops/clip.rs:82-89 | crates/polars-ops/src/series/ops/clip.rs:118-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/clip.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25f39425f4db72fbe892257b3c4fbd058ede078149599bcdaa7b6d374a6a254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/series/ops/cum_agg.rs:407-414 | crates/polars-ops/src/series/ops/cum_agg.rs:455-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/cum_agg.rs:407\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dbf139ae17a85143a33ebe37bf1b5bc6b0513a87d3d9206fbc2a93466cea69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/series/ops/is_first_distinct.rs:93-102 | crates/polars-ops/src/series/ops/is_last_distinct.rs:14-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_first_distinct.rs:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_first_distinct.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"43237025600427b18e551a692294cb8e38e5d67ff50f0d39449fb013168c1b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 3): crates/polars-ops/src/series/ops/is_in/mod.rs:402-409 | crates/polars-ops/src/series/ops/is_in/mod.rs:490-497 | crates/polars-ops/src/series/ops/is_in/mod.rs:752-753 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/is_in/mod.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":"crates/polars-ops/src/series/ops/is_in/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d2478e60603462790047432b90b6b7f189cc19f453d8b50add662578f1547d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/series/ops/rle.rs:117-124 | crates/polars-ops/src/series/ops/rle.rs:132-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/rle.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rle.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b9511cf9e884f947e4a5f10c1e9944c7c0cf922cf48c016c3b0d03f6796f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:45-52 | crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:95-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 \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:104\u0060 calls \u0060verify_dict_indices\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs:54\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8163464307b1be4baaed96a2a251d7370348ef1a3c4bbab37612d028835425a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-parquet/src/arrow/write/pages.rs:175-182 | crates/polars-parquet/src/arrow/write/pages.rs:277-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/pages.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea5608aac6b0a9d7226e7197c96a3013a4d25e39ea304c9b04c9738f6159b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/correlation.rs:19-26 | crates/polars-plan/src/plans/aexpr/function_expr/correlation.rs:15-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/function_expr/correlation.rs:19\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/correlation.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd9a176547fb51dabac617e57f9d144ed0a73e74824b2577f7712ea18244803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/dsl/scan_sources.rs:454-461 | crates/polars-plan/src/dsl/scan_sources.rs:479-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/scan_sources.rs:454\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/scan_sources.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce29e78daa89040ad5c22b5b8d222609d1d223b83095de8d6676b864fe97db9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:543-550 | crates/polars-plan/src/plans/conversion/type_coercion/binary.rs:92-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"227057a11531db9a63c4394bca8f9c0ac4e42339c06b66af5e1dba898e5eec73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/builder_ir.rs:296-303 | crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:1803-1810 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/builder_ir.rs:296\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/builder_ir.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac6038379e103ed1ba009c2c058b072d42becacff375c39cf4e11f5010a11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:1897-1904 | crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:1906-1913 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:1897\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d35b21ed79b1c8dbad3bfe465dfde82cf098fb5f3207367d6efe313318a77e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs:146-153 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.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 \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs:146\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd2094b880f89e90bfd0fcd91776c0a3605cf42cd64e94f7692ce13cddf413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:1201-1208 | crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs:1210-1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a6d5a3a96dc512248b080c030db6e50209726d3900e9ab3ff0def5cd70f211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/parquet_footers.rs:218-225 | crates/polars-plan/src/plans/parquet_footers.rs:246-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/parquet_footers.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/parquet_footers.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef0bcf4e8ab933787891286494f6baa6d94b5ab27b82391cc1d569280ee50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-plan/src/plans/python/pyarrow.rs:314-321 | crates/polars-plan/src/plans/python/pyarrow.rs:361-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/python/pyarrow.rs:314\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf55adfda4f86f980ba2ad407f72658dac447ebf509ec9d52d9ecfea8912182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-python/src/functions/eager.rs:69-76 | crates/polars-python/src/functions/eager.rs:87-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/eager.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"046cfa1c90c94dea8aa7dfd47c4c56f891d7a5d086b45576c0f734d818065f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-row/src/encode.rs:317-328 | crates/polars-row/src/encode.rs:438-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/encode.rs:317\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/encode.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ca5e9be488ff0c5d0e074f5f1fb58b825fcaa928aac5bf175bd5c0dece375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-sql/src/catalog.rs:626-633 | crates/polars-sql/src/sql_visitors.rs:458-465 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/catalog.rs:626\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dd1bfe725d29f23c2f8c76a4f3966670de5eff93a2afea4f9ef05ac136544c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-sql/src/context.rs:8385-8392 | crates/polars-sql/src/context.rs:8560-8566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:8385\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":8385}}}],"partialFingerprints":{"codehealthFindingId/v1":"009a06a7c83cee94409ca93a16eb50ccb4f844a58adb9acb421673189cd9e74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-sql/src/group_context.rs:381-387 | crates/polars-sql/src/group_context.rs:419-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 \u0060crates/polars-sql/src/group_context.rs:381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/group_context.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedcf91584ae64aaddc7d9114cc78872a51ddacbded0a839a4c2add0b1a3a01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-sql/src/subquery.rs:430-437 | crates/polars-sql/src/subquery.rs:1918-1925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-sql/src/subquery.rs:1914\u0060 calls \u0060is_none\u0060, \u0060Ok\u0060 and \u0060crates/polars-sql/src/subquery.rs:428\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efd1f5a3a5b8f164d62c4093cea78da380b1ab811b91c7f42e80a8d09c6a09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/execution_order.rs:40-47 | crates/polars-stream/src/execution_order.rs:82-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 \u0060crates/polars-stream/src/execution_order.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":"crates/polars-stream/src/execution_order.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aa52e841aa79f79ca387ae332d39d5d5a80a64ad8b93e33498ef92a8050b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:113-120 | crates/polars-stream/src/nodes/io_sources/lines.rs:109-116 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/lines.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 \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdd37c0cb7f6768b010209620397dc50b86bb1b4518f0bdba96ed0b9e1ae342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/joins/merge_join.rs:419-426 | crates/polars-stream/src/nodes/joins/merge_join.rs:428-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06c1e243422b5f8417744a23bc6f15bb5e235405dbb939d2ca3fb734db1e6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/joins/merge_join.rs:779-786 | crates/polars-stream/src/nodes/joins/merge_join.rs:788-795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/merge_join.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"514568cbd6ee00a92e9cf0ccf5670e17522e769b93aabec2369940deff4ff5a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/joins/range_join.rs:106-113 | crates/polars-stream/src/nodes/joins/range_join.rs:115-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/range_join.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a537f2d3f94691d56ca09ce4a2117506069092e99b26f46d27596ec20279edd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/scalar_window.rs:267-274 | crates/polars-stream/src/nodes/window/mod.rs:257-264 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/scalar_window.rs:267\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/scalar_window.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baba775766b4ee158e53474ba1669106543209ed66dfbc5508b6b9f8297016a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/top_k.rs:412-419 | crates/polars-stream/src/nodes/top_k.rs:556-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 \u0060crates/polars-stream/src/nodes/top_k.rs:412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"da219dc898913c49f441ef9e74ecaa891daa19b0fe5dcaa5208b27e46d82ff06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_group_by.rs:1659-1665 | crates/polars-stream/src/physical_plan/lower_group_by.rs:1681-1688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_group_by.rs:1659\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/physical_plan/lower_group_by.rs:1658\u0060 calls \u0060to_vec\u0060 and \u0060crates/polars-stream/src/physical_plan/lower_group_by.rs:1680\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ef1ad63680e2acc196900a344d054f78e53e94c43de4640f113179f0cd4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_description.rs:590-597 | crates/polars-stream/src/physical_plan/to_description.rs:616-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_description.rs:590\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2badf7b0d5d87f73efea05e6a607db55abba26fb7374199c0d5cb14bab76814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:827-835 | crates/polars-stream/src/physical_plan/to_graph.rs:1469-1476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:827\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2125c5e0ba062fd58dc6245c943398856e8b7089e3fdbab5f7c3ce9442f6bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:562-569 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:575-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:562\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b911ef0131d5472fc855cd9471030f628521f630d4d9a8c52f5e547cf4982939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 5): crates/polars-stream/src/physical_plan/lower_expr.rs:1066-1071 | crates/polars-stream/src/physical_plan/lower_expr.rs:1250-1255 | crates/polars-stream/src/physical_plan/lower_expr.rs:1285-1290 | crates/polars-stream/src/physical_plan/lower_expr.rs:1316-1321 | crates/polars-stream/src/physical_plan/lower_expr.rs:1421-1427 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1066\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ce6bf26b5ab59ec5e25fab9d3f83bcef236ab3034ac41fdd0556b11919b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/polars-ops/src/series/ops/log.rs:80-86 | crates/polars-ops/src/series/ops/log.rs:103-109 | crates/polars-ops/src/series/ops/log.rs:126-132 | crates/polars-ops/src/series/ops/log.rs:157-163 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/log.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":"crates/polars-ops/src/series/ops/log.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d3062eb135769a7d85dd07363c1d2957a8a39035f209931971222e865b3e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-buffer/src/storage.rs:158-164 | crates/polars-buffer/src/storage.rs:217-223 | crates/polars-buffer/src/storage.rs:236-242 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-buffer/src/storage.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/storage.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3219873c583bab6f191442e614d4d80f7db90196e537fe6b7647e54a0cb0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:469-475 | crates/polars-core/src/series/arithmetic/fixed_size_list.rs:519-525 | crates/polars-core/src/series/arithmetic/fixed_size_list.rs:569-575 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:469\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2e25233626fd8b25f97e5547e481243745fe6576f93a2a373676c061d79016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-expr/src/idx_table/binview.rs:223-229 | crates/polars-expr/src/idx_table/binview.rs:240-247 | crates/polars-expr/src/idx_table/row_encoded.rs:147-154 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/idx_table/binview.rs:223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3a7c3179e8098dde3964a0174550fcc77854b826d19bb02ccca72ba46d6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-json/src/json/write/serialize.rs:187-193 | crates/polars-json/src/json/write/serialize.rs:202-208 | crates/polars-json/src/json/write/serialize.rs:217-223 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-json/src/json/write/serialize.rs:186\u0060 calls \u0060unwrap\u0060 and \u0060crates/polars-json/src/json/write/serialize.rs:201\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76d9f76e72aec8d62ba395dcd2a8526cc9d1989e276c03f44217d897c42caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-ops/src/chunked_array/array/sum_mean.rs:55-61 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:65-71 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:216-222 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/sum_mean.rs:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/sum_mean.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8d0e742ba95de1597a143b13ad922e81cc30148eff05eae87f06ea9037143b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-ops/src/chunked_array/list/dispersion.rs:6-12 | crates/polars-ops/src/chunked_array/list/dispersion.rs:51-57 | crates/polars-ops/src/chunked_array/list/dispersion.rs:87-93 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs:6\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/dispersion.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c45dd08337c482075d9500b89de986f56ed6284dc6b503cab6c76a89a440712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-ops/src/chunked_array/list/sum_mean.rs:88-94 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:108-114 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:123-129 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/sum_mean.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/sum_mean.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a037d3a685ef9d012f551d71d97d5442da38b2208d7a117181859b29cb223007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-ops/src/chunked_array/strings/pad.rs:66-72 | crates/polars-ops/src/chunked_array/strings/pad.rs:83-89 | crates/polars-ops/src/chunked_array/strings/pad.rs:100-106 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/pad.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/pad.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4088985fe423da4d05100c6e966205993fb5feb4fa57332888b0404af703a1dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-parquet/src/arrow/write/binary/nested.rs:24-30 | crates/polars-parquet/src/arrow/write/binview/nested.rs:20-26 | crates/polars-parquet/src/arrow/write/fixed_size_binary/nested.rs:19-25 \u2014 \u0060crates/polars-parquet/src/arrow/write/binary/nested.rs\u0060 and \u0060crates/polars-parquet/src/arrow/write/binview/nested.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 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/nested.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a288b86e3626481752effc3743afefbdaa8a58f8b8f241c27b1acb55838e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-parquet/src/arrow/write/mod.rs:469-475 | crates/polars-parquet/src/arrow/write/mod.rs:773-779 | crates/polars-parquet/src/arrow/write/mod.rs:797-803 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:469\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"10683c019da9ab912a36890b9c5a506b1874d6d3848a5d10a38f075d42b0647a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-sql/src/subquery_pull_up.rs:1132-1138 | crates/polars-sql/src/subquery_pull_up.rs:1155-1161 | crates/polars-sql/src/subquery_pull_up.rs:1227-1233 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/subquery_pull_up.rs:1132\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery_pull_up.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"512dcd36f0ded2ea5c6ab86838dee7ed0b0afc9f06b255caa70c74f94994c57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs:21-33 | docs/source/src/rust/user-guide/concepts/expressions.rs:6-18 | docs/source/src/rust/user-guide/getting-started.rs:7-18 \u2014 before extracting anything, compare \u0060docs/source/src/rust/user-guide/concepts/expressions.rs\u0060 and \u0060docs/source/src/rust/user-guide/getting-started.rs\u0060 as WHOLE FILES: this scan already matched 5 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/getting-started.rs:7\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e365c01230b2665752444f23e5c385c528b29ca4731ba35fc6a256d0a7a7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/approx_quantile.rs:629-636 | crates/polars-compute/src/approx_quantile.rs:1327-1334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/approx_quantile.rs:629\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/approx_quantile.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff42e899ec4295c9d483800b718a9323ce8b6e01ab1fff72f9dbe2473951f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-compute/src/approx_quantile.rs:841-847 | crates/polars-compute/src/approx_quantile.rs:1386-1392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/approx_quantile.rs:841\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/approx_quantile.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"c877a8503cc06ea7228170cf32207f83241fc1a4442dfa945d0e962aae5cca73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-compute/src/float_sum.rs:296-302 | crates/polars-compute/src/float_sum.rs:308-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/float_sum.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3e37733c808e9b07b86d613c9814357468aaa550a13e9919867f520fc8d8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-compute/src/propagate_nulls.rs:89-95 | crates/polars-compute/src/propagate_nulls.rs:178-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/propagate_nulls.rs:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060arr\u0060 to \u0060\u0026dyn Array\u0060 in one and \u0060\u0026FixedSizeListArray\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/propagate_nulls.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f662bf887ca46bd182c0cdca6f0cb21942bb8c751ba8e3f5b5ffaab9ab74a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-compute/src/sum.rs:55-61 | crates/polars-compute/src/sum.rs:70-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/sum.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c44eaa18d2e5d2d63f365eb49227368d7bf3d49c5e512c9dc2b019f7f8bc7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:633-645 | crates/polars-compute/src/unique/distinct.rs:790-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:633\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75a697165ac6c34b0561a5e36bba430145d5241a182a2225600d93de7c6de23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/arity.rs:586-592 | crates/polars-core/src/chunked_array/ops/arity.rs:671-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dc1a60fd647ff196c49e72dcf6cb701536fd2a3d0102a5b308e1c820631ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1013-1019 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1086-1092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1013\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d0e6dd8d2fbcae82f0b5626605ed481ab8f6853a0f8d52a6524bcd2904308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:646-652 | crates/polars-core/src/frame/mod.rs:761-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/mod.rs:646\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698cf5d23a2d448fba7b7617c8bd364a57b8934209b307cf1d0b6d9a6975520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/polars-core/src/frame/row/dataframe.rs:84-90 | crates/polars-python/src/dataframe/construction.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/row/dataframe.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d79efa2624dd1d549fe8ad0bc1582fae1f3b8f16ab9d87885567b664665cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): crates/polars-core/src/series/arithmetic/fixed_size_list.rs:737-739 | crates/polars-core/src/series/arithmetic/list.rs:586-592 | crates/polars-core/src/series/arithmetic/list.rs:687-693 | crates/polars-core/src/series/arithmetic/list.rs:939-941 \u2014 before extracting anything, compare \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs\u0060 and \u0060crates/polars-core/src/series/arithmetic/list.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:737\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-core/src/series/arithmetic/list.rs:585\u0060 calls \u0060Some\u0060, \u0060clone\u0060, \u0060make_mut\u0060 and \u0060crates/polars-core/src/series/arithmetic/fixed_size_list.rs:737\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/fixed_size_list.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b76164ee18b02a6ed696cc353fa470251439fa0c0575fc3884db93eb34ead19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-core/src/series/from.rs:714-720 | crates/polars-core/src/series/from.rs:723-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/from.rs:714\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"4482e7d568d8a3cdfbd45ee8bcd5a967176a48b93a6af34e9f29a23784fe6c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-core/src/utils/mod.rs:1105-1111 | crates/polars-core/src/utils/mod.rs:1113-1119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c365218708382d13cc14ccebf0af74b8425fc035bada00b52ddf644f9737d423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/dispatch/range/int_range.rs:48-57 | crates/polars-expr/src/dispatch/range/time_range.rs:50-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/int_range.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400104202bc4765298b5574ab7ee0bd9c44651d7aab1086df892254782568be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/polars-expr/src/expressions/cast.rs:42-47 | crates/polars-expr/src/expressions/cast.rs:73-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/cast.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/cast.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cca0263ae01f656db53ba8bf5752fa42b1feab5429820ed72b43cf029f9159f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/expressions/eval.rs:172-180 | crates/polars-expr/src/expressions/eval.rs:348-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/eval.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":"crates/polars-expr/src/expressions/eval.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5687643b9111d401e342b7398206d51f1eed4e0f98a584c107378ec2d48d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/count.rs:114-120 | crates/polars-expr/src/reduce/count.rs:246-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/count.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/count.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a206c5aceb97765e0b345c30205df9c78d811a07afcf0421714401527131be8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/count.rs:232-238 | crates/polars-expr/src/reduce/has_nulls.rs:52-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/count.rs:232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/count.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a37116c675eae953dcecb491bf5a1ffde883fdad6338b402fa0eaaeb2c194e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/reduce/cov.rs:141-149 | crates/polars-expr/src/reduce/cov.rs:285-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"081131a26d86f95ccf8e07058b244000fe5c23b22e5c901fcc4ca91fa1857239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/min_max_by.rs:629-635 | crates/polars-expr/src/reduce/min_max_by.rs:683-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba0af35b009e21483d120fa04df695f892c4e51ff54d1b61fe2e870033f6368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-io/src/csv/read/parser.rs:448-454 | crates/polars-io/src/csv/read/parser.rs:693-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/read/parser.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3ee9e4b061277e0bf38373d22308b8a3563b0711809222ffe4a4cff33a1a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-mem-engine/src/planner/lp.rs:437-443 | crates/polars-mem-engine/src/planner/lp.rs:448-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/planner/lp.rs:448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9a74f311ed6eeb5f1432c13bf6f4d6ea7ade7b8da6fa805a49ffa9b564318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:114-120 | crates/polars-ops/src/chunked_array/strings/substring.rs:244-250 \u2014 before extracting anything, compare \u0060crates/polars-ops/src/chunked_array/binary/slice.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/strings/substring.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"93927e4471a411ff72ab9ad4e0517d147e9b697a7c46f543af515ce381175df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/dispersion.rs:22-28 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:240-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/dispersion.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6092a72ef1fbdcb9f31833bb3dcf306df9bb7eb3539e8b5001c0c6c8794823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/dispersion.rs:30-36 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:248-254 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/dispersion.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ff147f1f98527420ceb74ca9d0e4b6e0477671b2c6a6076dcce8b4fc1d37c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/min_max.rs:68-74 | crates/polars-ops/src/chunked_array/list/min_max.rs:186-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/min_max.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":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d8d5fcde53e53dda3ca3b34d1399adc4be168e989e57970b9895c887276d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:155-161 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:168-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.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":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3499ca6e82b6020c347dca1662e2becb1901af0ffa41ea30b6ea088ce93784c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:26-35 | crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs:63-72 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb44c00b0c0773b6797b43d13e20292a7d09e555ae88d2610e7ded67ee1b6859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs:36-42 | crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs:47-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs:36\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binary/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"78efa7393ef7bf3e03feace0c6f6687bad2eee27e39eb2f458e64839a3bbf76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/mod.rs:129-135 | crates/polars-parquet/src/arrow/read/deserialize/primitive/plain/mod.rs:181-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/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":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace7c22c9551dc4df4a9a37e13dbccbfcc9ad15c10b18f8f0e201244d438c2db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-parquet/src/arrow/write/mod.rs:903-909 | crates/polars-parquet/src/arrow/write/mod.rs:1123-1129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/mod.rs:903\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/mod.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59c83eb8e99c73e5fa7e679cb77263bf6d252644fbd531bd57fbe1a91a64f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-parquet/src/arrow/write/pages.rs:224-230 | crates/polars-parquet/src/arrow/write/pages.rs:247-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/pages.rs:224\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/pages.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdd87a95670263b2036e3da3b27959afc3fd2d7b8de8d70774e6f821b19800b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-parquet/src/arrow/write/primitive/basic.rs:222-228 | crates/polars-parquet/src/arrow/write/primitive/basic.rs:231-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/write/primitive/basic.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/primitive/basic.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9a59562d0375f4890552a91c8faea53a965716031a9f8a3ef841bf97afd72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/dsl/file_scan/mod.rs:1221-1227 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs:309-315 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/dsl/file_scan/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"05db800127cf1fad27d45639bb1ac03eac07b8a31f0e216432b3818cfa3bbdc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:984-990 | crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:1096-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 \u0060crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs:984\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1bafffcdc7dbbbb14b1008f147ad69a7c8ba66739872d3cdc1691224c7a233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/plans/to_description.rs:220-226 | crates/polars-stream/src/physical_plan/to_description.rs:746-752 \u2014 before extracting anything, compare \u0060crates/polars-plan/src/plans/to_description.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_description.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/to_description.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60a2cf1a7e67b1f21a6b9e8ec527e4a7e981b3d094ee396eae5486ceac80e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-python/src/conversion/any_value.rs:607-614 | crates/polars-python/src/conversion/any_value.rs:625-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/conversion/any_value.rs:607\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"729db4d927dd58c8f2104d11d6517f55216b6778d0654306377d3eb9f4992afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-python/src/interop/arrow/to_rust.rs:150-156 | crates/polars-python/src/interop/arrow/to_rust.rs:172-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/interop/arrow/to_rust.rs:150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/arrow/to_rust.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"598e8eb8f379492b230b296dcb7afb44f7d8e756487002098fde547d21a2d06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1682-1688 | crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1695-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 \u0060crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1682\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4c5292bdfb2e4f5e889bdf45f5affe89f0d0020fddb31b19e4330e83ec5a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/polars-sql/src/catalog.rs:1180-1185 | crates/polars-sql/src/catalog.rs:1189-1195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/catalog.rs:1189\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc610ff7ebd0109781e1002efc36e8a764829caf3fe132cac24f79a93a93b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-sql/src/sql_expr.rs:633-639 | crates/polars-sql/src/sql_expr.rs:652-658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c53394fa6a064ef26f73aaf80e94504e070be7b0ceea2be11173497a32ff9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/nodes/dynamic_group_by.rs:182-188 | crates/polars-stream/src/nodes/rolling_group_by.rs:124-130 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb76586e20dfd03b8c88e09e49ce5b66cee0393411b3e86c59e6c9fc53cc75ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/nodes/negative_slice.rs:147-153 | crates/polars-stream/src/nodes/reverse.rs:112-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/negative_slice.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/nodes/negative_slice.rs:146\u0060 calls \u0060unsigned_abs\u0060 and \u0060crates/polars-stream/src/nodes/reverse.rs:111\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/negative_slice.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af4b9057cdd3d0bc74b80188180215f48d84e24e2d98c6896a2261f98dbd070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:2205-2211 | crates/polars-stream/src/physical_plan/lower_expr.rs:2371-2377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:2205\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4988ac8b1e05755a747c2556b12b6e952b58f9cd1035a0717658bb966da66dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-time/src/series/mod.rs:152-158 | crates/polars-time/src/series/mod.rs: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 \u0060crates/polars-time/src/series/mod.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/series/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b4ee1b286ecdcd754fbecfac3ace15efea2367b7e6fb212beb4cf45796a667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/polars-core/src/frame/group_by/aggregations/mod.rs:539-544 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:720-725 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:824-829 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:898-904 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:991-997 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1056-1062 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:539\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a11069ee96ae486f596b0b50777aaf078518b409c87f46e94d49c0226832a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/polars-expr/src/reduce/any_all.rs:91-96 | crates/polars-expr/src/reduce/any_all.rs:190-195 | crates/polars-expr/src/reduce/bitwise.rs:215-220 | crates/polars-expr/src/reduce/min_max.rs:494-499 | crates/polars-expr/src/reduce/min_max.rs:610-615 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/any_all.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/any_all.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/reduce/bitwise.rs:221\u0060 calls \u0060xor_pos_unchecked\u0060, \u0060get_unchecked\u0060 and \u0060crates/polars-expr/src/reduce/any_all.rs:97\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1eafffdc130c88d544b286a55d260bee012fb4973eded75438756bec39b6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-ops/src/chunked_array/array/dispersion.rs:20-25 | crates/polars-ops/src/chunked_array/array/dispersion.rs:55-60 | crates/polars-ops/src/chunked_array/array/dispersion.rs:90-95 | crates/polars-ops/src/chunked_array/list/dispersion.rs:67-72 \u2014 \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.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":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b45335c357492cea76663205a7dfabe5d9a1bdf1906851611313e899d6b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-ops/src/chunked_array/gather/chunked.rs:539-544 | crates/polars-ops/src/chunked_array/gather/chunked.rs:582-587 | crates/polars-ops/src/chunked_array/gather/chunked.rs:749-754 | crates/polars-ops/src/chunked_array/gather/chunked.rs:800-805 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3712b55fab50f506020c87d14cf8ff404f387944e738d0b064ddf965f0fa96ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-parquet/src/arrow/write/binary/nested.rs:23-28 | crates/polars-parquet/src/arrow/write/binview/nested.rs:19-24 | crates/polars-parquet/src/arrow/write/boolean/nested.rs:18-23 | crates/polars-parquet/src/arrow/write/fixed_size_binary/nested.rs:18-23 \u2014 \u0060crates/polars-parquet/src/arrow/write/binary/nested.rs\u0060 and \u0060crates/polars-parquet/src/arrow/write/binview/nested.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 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/nested.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63126a4afad01c39ae8010440d6a060a20aaa0b5162487950b2f771d38bf057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs:27-32 | docs/source/src/rust/user-guide/concepts/expressions.rs:12-17 | docs/source/src/rust/user-guide/getting-started.rs:12-17 | docs/source/src/rust/user-guide/getting-started.rs:183-188 \u2014 before extracting anything, compare \u0060docs/source/src/rust/user-guide/concepts/expressions.rs\u0060 and \u0060docs/source/src/rust/user-guide/getting-started.rs\u0060 as WHOLE FILES: this scan already matched 5 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs:27\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"docs/source/src/rust/user-guide/concepts/data-types-and-structures.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b02223d5d8ee60a3635cbb86efad767e54b54bd39bf9595a9209eb0eb387c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-core/src/utils/supertype.rs:293-298 | crates/polars-core/src/utils/supertype.rs:309-314 | crates/polars-core/src/utils/supertype.rs:316-321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-core/src/utils/supertype.rs:287\u0060 calls \u0060is_unsigned_integer\u0060, \u0060is_bool\u0060, \u0060Some\u0060 and \u0060crates/polars-core/src/utils/supertype.rs:307\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29e1771dc9e498a22766d5b508f22da94b9243671d6fce72ec7af9e60ea1538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-expr/src/reduce/bitwise.rs:231-236 | crates/polars-expr/src/reduce/min_max.rs:510-515 | crates/polars-expr/src/reduce/min_max.rs:626-631 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/bitwise.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/bitwise.rs:231\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/bitwise.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25f22b136815e826a18f965e8d441ea753c5777e4609263f030206193707e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/traverse.rs:32-37 | crates/polars-plan/src/plans/aexpr/traverse.rs:125-130 | crates/polars-plan/src/plans/aexpr/traverse.rs:246-251 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/traverse.rs:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/traverse.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"39df54f7060f27c1fb06cebfac3be500fd705dffb3a18af4bf5ceb9c60db8501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-stream/src/physical_plan/lower_expr.rs:1446-1451 | crates/polars-stream/src/physical_plan/lower_expr.rs:1493-1498 | crates/polars-stream/src/physical_plan/lower_expr.rs:1526-1531 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1446\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62669210dd765826281a7b5ba3f014acc55130cb3642863a6b6a4fb8e22dedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:245-250 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:342-347 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:540-547 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d98f449689823723499baa4605124b4113873382a98e5dbe523794e04b55e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs:5-10 | docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs:16-21 | docs/source/src/rust/user-guide/concepts/streaming.rs:5-10 \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":"docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67765d3c97e932755de09376a3aae522862221a248702bfd29324342c5ee0c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-compute/src/approx_quantile.rs:832-837 | crates/polars-compute/src/approx_quantile.rs:1378-1383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/approx_quantile.rs:832\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/approx_quantile.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01e05ee3363657b411969fd5e7b480cbab1c9379dedc7cf3c4ceff69d74d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:616-621 | crates/polars-compute/src/unique/distinct.rs:665-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:616\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e1fff21bd6cc2df8b1fedd24d229bf7e975c8a964bdc9b6b8fd0e2dbfa5be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/unique/primitive.rs:102-109 | crates/polars-compute/src/unique/primitive.rs:121-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 \u0060crates/polars-compute/src/unique/primitive.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/primitive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd12c7ee2f2dec039fa5a5e01fae57c410db3689b3ebd380371fe5d8e7486f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/chunked_array/cast.rs:237-242 | crates/polars-core/src/chunked_array/cast.rs:255-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/chunked_array/cast.rs:237\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a0d5c02bf81250c0e794482fef361ce25100e97ace5c4f4f8105816b68b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/arity.rs:701-711 | crates/polars-core/src/chunked_array/ops/arity.rs:742-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 \u0060crates/polars-core/src/chunked_array/ops/arity.rs:701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/arity.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"091d9d7e1d0f5d704dbdb5be44f8cd64dbf199e1dfe1bab0db9f8414efaa4e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs:16-21 | crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs:37-42 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/float_sorted_arg_max.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe225fdd36a283f4ecf74a9df1e250f9945ae4f43c9e258f0908ff9f66a80cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-core/src/datatypes/any_value.rs:565-573 | crates/polars-core/src/datatypes/any_value.rs:618-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/datatypes/any_value.rs:565\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed13a67d7484569c12e64f0d41d978b539d338b947964ea951d8d37ff5fcd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/frame/group_by/aggregations/mod.rs:1311-1316 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1355-1360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:1311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f769535087b9f0b1c9a4d3d434d69b2f437d901db32d1e85ea0cd01703d122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/series/arithmetic/list.rs:744-749 | crates/polars-core/src/series/arithmetic/list.rs:795-800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/series/arithmetic/list.rs:744\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/list.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fbb6063ac5d0f6a7b48bffccdeca8dadc951a96785b83375f278dec2aad446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/utils/mod.rs:843-849 | crates/polars-core/src/utils/mod.rs:865-870 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/utils/mod.rs:843\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce02eff65c70d5a7595923567e70c5edac9f2ea9e3571f5389840a35ac34223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/dispatch/horizontal.rs:107-112 | crates/polars-expr/src/dispatch/horizontal.rs:152-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/horizontal.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf70228995cbe772946cf9f24b0ac43c28b45903625c6483e643167cfdde2d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-expr/src/dispatch/rolling.rs:26-36 | crates/polars-expr/src/dispatch/rolling_by.rs:23-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/rolling.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/rolling.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53004b68dffe635ab7bbac305deec97f680b725fdb61337d7f4d0a813fcbfdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/expressions/slice.rs:180-185 | crates/polars-expr/src/expressions/slice.rs:223-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/slice.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":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58650a6e0af3a6a253cb5d41d3cd52c0335bc30c46a21ed4c5f2ae34ea37ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/hot_groups/fixed_index_table.rs:107-113 | crates/polars-expr/src/hot_groups/fixed_index_table.rs:118-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/fixed_index_table.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e770568a1207518a3c86b2a181ce97cc838e5449f8b0c0c91e777100488214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/polars-expr/src/reduce/any_all.rs:48-53 | crates/polars-expr/src/reduce/any_all.rs:249-252 | crates/polars-expr/src/reduce/min_max.rs:561-566 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/any_all.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-expr/src/reduce/any_all.rs:48\u0060 calls \u0060dtype\u0060 and \u0060crates/polars-expr/src/reduce/any_all.rs:249\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed833a48f39f2f10de37358937f1e7ccfdd366f05633c2fd76f7eef300a49d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/count.rs:105-111 | crates/polars-expr/src/reduce/count.rs:237-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/count.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/count.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6aacf4a7811e79036e3dd1fbcf6b204bf8b5517eb49a9426da221c8e713cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/reduce/min_max_by.rs:69-74 | crates/polars-expr/src/reduce/min_max_by.rs:144-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/min_max_by.rs:69\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb4226cc10b384ecb332f842d60fe1fa0a4a4fdcfe32bd53b43578eb680c5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:515-521 | crates/polars-expr/src/reduce/mod.rs:763-769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/mod.rs:515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/reduce/mod.rs:770\u0060 calls \u0060get_unchecked\u0060 and \u0060crates/polars-expr/src/reduce/mod.rs:522\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"559ac8393d8e6e9854b8fb114765f0cb717f3dc7deabe0cc8d43119926714592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-io/src/utils/other.rs:105-111 | crates/polars-io/src/utils/other.rs:134-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/other.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"40194b0d1dd7ce58080cc9cf19b4b14f62b5b3e291527ee4fff8d21c01914cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:183-188 | crates/polars-ops/src/chunked_array/strings/substring.rs:320-326 \u2014 before extracting anything, compare \u0060crates/polars-ops/src/chunked_array/binary/slice.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/strings/substring.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:183\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5cffb74f783f90e8cde5f870f04e98daf3054177b4243531e468f95a68346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:207-212 | crates/polars-ops/src/chunked_array/strings/substring.rs:348-354 \u2014 before extracting anything, compare \u0060crates/polars-ops/src/chunked_array/binary/slice.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/strings/substring.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef692fa94f775bdf34d38f2af30ba28636cee45828dd530d6b48c0aa081c1c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:234-241 | crates/polars-ops/src/chunked_array/gather/chunked.rs:334-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3ac904c3b8fbe0beb96a253b2e25ec497d288d9498c27d5686fc82f182a438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/min_max.rs:82-88 | crates/polars-ops/src/chunked_array/list/min_max.rs:200-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 \u0060crates/polars-ops/src/chunked_array/list/min_max.rs:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/min_max.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edf4a9bb2bf10afe4c5b7ae6c58d33b76096d2fd79fb967d2306535eebb4a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/chunked_array/repeat_by.rs:50-56 | crates/polars-ops/src/chunked_array/repeat_by.rs:64-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/repeat_by.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ca\u0060 to \u0060\u0026BooleanChunked\u0060 in one and \u0060\u0026BinaryChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/repeat_by.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a1c127df43c8c291358b1ab61ed7b289439a1e47644147a262d584639813a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs:64-69 | crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs:80-85 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"039a4fac739d77edbe0c62613b76525fed74a8927414fd8a8dcf60fe695de0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/series/ops/business.rs:74-79 | crates/polars-ops/src/series/ops/business.rs:265-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/business.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/business.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"277067f6f38e0d72976a30d3751af1df0b4f3de08a36c8778539cf1cbc4243c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/series/ops/business.rs:226-231 | crates/polars-ops/src/series/ops/business.rs:394-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/business.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/business.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a612dd191b608330218dca7de76505589c9682251045f725414d60115947deab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/series/ops/ewm_by.rs:139-144 | crates/polars-ops/src/series/ops/ewm_by.rs:164-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/ewm_by.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/ewm_by.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1652d9215678ca8da6b94b23543c36091ca0a6a8c5b1f30db2c2c4a93e97c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/series/ops/rank.rs:130-135 | crates/polars-ops/src/series/ops/rank.rs:140-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/rank.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/rank.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aed7044d791c0fc2c53db0e675cc172c392ca41b130e7025cbc768d1f3f666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-parquet/src/parquet/write/statistics.rs:181-189 | crates/polars-parquet/src/parquet/write/statistics.rs:195-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/statistics.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd29375ea45d0aaa2359bf9ace388dfe59fb9a172584860155ba7faf5559010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:839-844 | crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs:859-864 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8f2735603fa66ee058d6f5214e57f6a0f6f519ef07728ca5dbb7e357aa040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:2080-2085 | crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:2093-2098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs:2080\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b47f55b896474ba1bd01bf298eb1966ac66d997ddeaceb119e60ecceb431cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/functions/mod.rs:247-252 | crates/polars-plan/src/plans/functions/mod.rs:267-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/functions/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"128d110fbfcdae54e21e51f5db6798fc450d546ce285ccd920b1af33953f3caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/ir/format.rs:310-315 | crates/polars-plan/src/plans/ir/format.rs:367-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d44641dfa8c4fd4b1b97a2a6e3fbaa7187731e192cc877797b8b32b8f0ad5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-python/src/functions/range.rs:119-124 | crates/polars-python/src/functions/range.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fe50f6459db988e4a13a4a74ba3137fdd33b129033b1df28e7b00e948f1a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/context.rs:915-920 | crates/polars-sql/src/context.rs:982-987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:915\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62b4fcae089047c4adf65e83da749968114b7ae7d1e7b6e2a81c376a787315f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/context.rs:2588-2593 | crates/polars-sql/src/context.rs:2607-2612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8156bfbe357d8a3c989f65670b34cfb252aac00f1d128e0c6d3b20442eef8adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/functions.rs:2659-2664 | crates/polars-sql/src/functions.rs:2672-2677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d56ebfc92c3cb149d2bda46c61d36f9613d0b2ef2cc34731a2ed816b85235e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/subquery.rs:372-377 | crates/polars-sql/src/subquery.rs:2406-2411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-sql/src/subquery.rs:371\u0060 calls \u0060into_iter\u0060, \u0060fold\u0060 and \u0060crates/polars-sql/src/subquery.rs:2401\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1f87ef08fc349da0abd343cd63868d7877f567e4a6c65b14b6df23dc1de5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/subquery.rs:1826-1831 | crates/polars-sql/src/subquery.rs:2021-2026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072402126f3d5315d8bb989f77120df2637388ea8c9186f603ae86a5b353dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/dynamic_group_by.rs:318-325 | crates/polars-stream/src/nodes/rolling_group_by.rs:259-266 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs:318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"15317d018130134965e3b01f6e03ad53591355e3b2d9f92cb20eee95e14de0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/nodes/group_by/flush.rs:238-244 | crates/polars-stream/src/nodes/joins/equi_join/flush.rs:452-458 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/flush.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3610cec5bba49f3775414a66b88687fcac9e51f768d4240a8822992b94306bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-stream/src/nodes/joins/asof_join.rs:491-498 | crates/polars-stream/src/nodes/joins/asof_join.rs:570-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a518daa146c1ba97fff4f111efcbc380c3fc7e6c0c835cf2853684b5fafec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:1201-1208 | crates/polars-stream/src/physical_plan/lower_expr.rs:1523-1528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e87c50fab56fba1437c07bb3c8b3e57084dc4a24e93f716869ce9e06dec786b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:327-332 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:523-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:327\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1259a533823890f0ff97d70ba3e5e84e657483f354b3252395d37bc40ef8e285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/polars-expr/src/reduce/any_all.rs:91-95 | crates/polars-expr/src/reduce/any_all.rs:190-194 | crates/polars-expr/src/reduce/any_all.rs:302-306 | crates/polars-expr/src/reduce/any_all.rs:428-432 | crates/polars-expr/src/reduce/bitwise.rs:215-219 | crates/polars-expr/src/reduce/is_empty.rs:92-96 | crates/polars-expr/src/reduce/min_max.rs:494-498 | crates/polars-expr/src/reduce/min_max.rs:610-614 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/any_all.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/any_all.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/reduce/bitwise.rs:221\u0060 calls \u0060xor_pos_unchecked\u0060, \u0060get_unchecked\u0060 and \u0060crates/polars-expr/src/reduce/any_all.rs:97\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a33b3ed8611f68c8712f40cc79181636def99b08a9d9a5f4261d6021e632347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/polars-core/src/frame/builder.rs:95-99 | crates/polars-core/src/frame/builder.rs:123-127 | crates/polars-core/src/frame/builder.rs:158-162 | crates/polars-core/src/frame/builder.rs:195-199 | crates/polars-core/src/frame/builder.rs:225-229 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/builder.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/builder.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7133ac37b90a468b7f4079a7b0205cf1d2bffa9d7c3e4bda0925d218df21b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/polars-expr/src/reduce/count.rs:60-65 | crates/polars-expr/src/reduce/count.rs:97-102 | crates/polars-expr/src/reduce/count.rs:230-235 | crates/polars-expr/src/reduce/has_nulls.rs:50-55 | crates/polars-expr/src/reduce/is_empty.rs:57-62 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/count.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5513d28224e8fe9e8b25ab3724354a215c078c89998c64ec408f7616a43f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/polars-core/src/frame/group_by/aggregations/mod.rs:522-527 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:703-708 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:75-79 | crates/polars-ops/src/chunked_array/nan_propagating_aggregate.rs:142-146 \u2014 before extracting anything, compare \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/nan_propagating_aggregate.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:522\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6cd3f9a7fc32765627fbc2899b273b6ba53f421f72e3e0b3853a0012a986ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/polars-core/src/frame/group_by/aggregations/mod.rs:560-564 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:741-745 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1015-1019 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:1088-1092 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c9a1d3c09364b8a31b7728067269308295137e7f2d54d9e53a6c0ec605aa82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/polars-expr/src/dispatch/struct_.rs:44-48 | crates/polars-expr/src/dispatch/struct_.rs:70-74 | crates/polars-expr/src/dispatch/struct_.rs:87-91 | crates/polars-expr/src/dispatch/struct_.rs:104-108 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/struct_.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/struct_.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad040a8c218e78e6d4e85a00a72fa3ea68160de29e43bfb5f5f0c483213639e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-expr/src/reduce/mod.rs:427-432 | crates/polars-expr/src/reduce/mod.rs:470-475 | crates/polars-expr/src/reduce/mod.rs:691-696 | crates/polars-expr/src/reduce/mod.rs:725-730 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6402315d61e1ce89cc7ad6688063d0c26e3b51f9eb6c06d0a0581966845f8c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/polars-stream/src/physical_plan/to_graph.rs:218-222 | crates/polars-stream/src/physical_plan/to_graph.rs:870-874 | crates/polars-stream/src/physical_plan/to_graph.rs:1741-1746 | crates/polars-stream/src/physical_plan/to_graph.rs:1822-1826 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1819\u0060 calls \u0060clone\u0060 and \u0060crates/polars-stream/src/physical_plan/to_graph.rs:1738\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"522abe1aa9b3f87e72e527fc2d43f3d5e0ffee061bfe1bd8855b783780ecbc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/polars-core/src/frame/group_by/aggregations/mod.rs:517-522 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:698-703 | crates/polars-core/src/frame/group_by/aggregations/mod.rs:952-957 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/group_by/aggregations/mod.rs:517\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e9e64415cd5a434d6bb4892b08280fd245676e54cd50c54c3955912b74b4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-expr/src/groups/binview.rs:231-235 | crates/polars-expr/src/groups/binview.rs:274-278 | crates/polars-expr/src/groups/binview.rs:315-319 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"351ffd2f02eda72abd0b21c07c35d5dfcf0a5b314f1adfcd123571740bd697ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-io/src/cloud/credential_provider.rs:812-818 | crates/polars-io/src/cloud/credential_provider.rs:889-895 | crates/polars-io/src/cloud/credential_provider.rs:995-1001 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/cloud/credential_provider.rs:812\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/credential_provider.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f65f5bf8ef69532aa371659c34e9ac3cb4cd561c5c8b2ead665af510efd6ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-ops/src/chunked_array/array/dispersion.rs:27-31 | crates/polars-ops/src/chunked_array/array/dispersion.rs:62-66 | crates/polars-ops/src/chunked_array/list/dispersion.rs:74-78 \u2014 \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.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":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85c597474fb3d6d2a5219208e61edf1833558b139258b19b692aef48b43fdc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:76-80 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:305-309 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:400-404 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf8762e6e07af097fa7045964e270e235f1df24f2d862fcf0f0aa6c27b4674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:82-86 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:311-315 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:406-410 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"12660149237caaaa4412837bb759f202e61b60bd6c51e6e33ba894b78979a23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-sql/src/functions.rs:3021-3025 | crates/polars-sql/src/functions.rs:3034-3038 | crates/polars-sql/src/functions.rs:3197-3201 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"369e5ce44ba57ccfe3db08a4249f5c3244903c0c8284c0de48a6ddd95c7e3ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-stream/src/nodes/dynamic_group_by.rs:181-185 | crates/polars-stream/src/nodes/rolling_group_by.rs:123-127 | crates/polars-stream/src/nodes/sorted_group_by.rs:99-103 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/dynamic_group_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/rolling_group_by.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6c1353b1ff919a73a588f5f2a82ce703ffc86f53f4a0bd01c7d9a0518978f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-stream/src/physical_plan/lower_expr.rs:1201-1209 | crates/polars-stream/src/physical_plan/lower_expr.rs:1492-1496 | crates/polars-stream/src/physical_plan/lower_expr.rs:1523-1529 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:1201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eab882b622d74876d7cf423ad0fe41a91131a46a755f1343728682c299d400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/moment.rs:653-657 | crates/polars-compute/src/moment.rs:676-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/moment.rs:653\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/moment.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3f9c9c908d8bba5d1dfef7abcdb9aaa9397e35ed69dac4a8075d64a4cd0e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:492-496 | crates/polars-compute/src/unique/distinct.rs:632-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:492\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada68e90eb69ea6fe80e81f2bddcdf598728f6d606ca9befd1db54ab94995853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:570-575 | crates/polars-compute/src/unique/distinct.rs:742-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 \u0060crates/polars-compute/src/unique/distinct.rs:570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2317ddf5172fcfe09a157d913600340f8756dacc4e65d629b58137f8dd2b322e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:589-599 | crates/polars-compute/src/unique/distinct.rs:759-769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:589\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a917229485636a60fbc14075402fd70271c1e3bc639d43e4574bae35b71b348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:614-618 | crates/polars-compute/src/unique/distinct.rs:772-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:614\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b883e653ed3c84330161702ca44377fc7ad1ed8d537555fc4a118e42fdb34613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:663-667 | crates/polars-compute/src/unique/distinct.rs:805-809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:663\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aa660cd249a0c5d3935e565f5b59cb8696b1cf335114a129c0ee243bcb132e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:696-700 | crates/polars-compute/src/unique/distinct.rs:789-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:696\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8214496c4e11e6e27de12be2b9587aa056da51c64c779ef94920d1d4df461c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:774-778 | crates/polars-compute/src/unique/distinct.rs:807-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:774\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd3f6fa2bcff302ea2b6a0aaad7b4897302601f15aea61fba2e1b15701a266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/series/mod.rs:711-716 | crates/polars-core/src/series/mod.rs:762-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caf49436fb47d1fd8759df53afa097efb5a3f34c6e367a38e759cd028793ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/series/mod.rs:728-733 | crates/polars-core/src/series/mod.rs:745-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9ff97f58c1ab3dc016bfc3bf5a2b56e8442f33432a0175ec751b2520332c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/utils/supertype.rs:338-342 | crates/polars-core/src/utils/supertype.rs:344-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-core/src/utils/supertype.rs:344\u0060 calls \u0060Some\u0060 and \u0060crates/polars-core/src/utils/supertype.rs:350\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8238887c883dab07dd0d792be430582b11aa472b8576ab8124648a095a4dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/utils/supertype.rs:375-379 | crates/polars-core/src/utils/supertype.rs:383-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df0977111b9b712d091706cad6c04a5beae2d6b01688128092fce4e9aeb6b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:84-88 | crates/polars-expr/src/dispatch/groups_dispatch.rs:141-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/groups_dispatch.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb32b6c9edc245dfa89baace4edd87f681b6df8fcad704fa5960a0a96ff60bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/dispatch/pow.rs:43-48 | crates/polars-expr/src/dispatch/pow.rs:82-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/pow.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/pow.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc6c69a3516f36602ed980876c8d374eece7b66343a8d1e5a09f8ec74007c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/expressions/apply.rs:286-292 | crates/polars-expr/src/expressions/structeval.rs:105-111 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/expressions/apply.rs\u0060 and \u0060crates/polars-expr/src/expressions/structeval.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/polars-expr/src/expressions/apply.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3434490e7025a7930adf84460b1db082f79023cebf84aef11964e8002d304f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/hot_groups/single_key.rs:153-157 | crates/polars-expr/src/hot_groups/single_key.rs:164-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/hot_groups/single_key.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/hot_groups/single_key.rs:157\u0060 calls \u0060push_g\u0060, \u0060insert_key\u0060, \u0060insert_null\u0060 and \u0060crates/polars-expr/src/hot_groups/single_key.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":"crates/polars-expr/src/hot_groups/single_key.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1159e286f6cb7475867ed28afd1002f508ee56d4f76c159ba496294a7dd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/polars-expr/src/reduce/any_all.rs:148-152 | crates/polars-expr/src/reduce/any_all.rs:375-378 | crates/polars-expr/src/reduce/min_max.rs:446-450 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/any_all.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-expr/src/reduce/any_all.rs:147\u0060 calls \u0060dtype\u0060, \u0060as_materialized_series_maintain_scalar\u0060 and \u0060crates/polars-expr/src/reduce/any_all.rs:375\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5e18862403e9375ca25de444aeb8ed38db363011717c494392d637ff1d30bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:410-416 | crates/polars-expr/src/reduce/mod.rs:671-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-expr/src/reduce/mod.rs:678\u0060 calls \u0060null_count\u0060, \u0060set\u0060 and \u0060crates/polars-expr/src/reduce/mod.rs:417\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06fd3ead1b5ab6d2a591ae8ba06abc283cc26e41fa016900df8c51f30a7648e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:487-491 | crates/polars-expr/src/reduce/mod.rs:497-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f7528d9085ef086b8f580b68a5b7e298bc539fcdab6b1303207f96ba1de3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-mem-engine/src/executors/hconcat.rs:25-29 | crates/polars-mem-engine/src/executors/union.rs:43-47 \u2014 before extracting anything, compare \u0060crates/polars-mem-engine/src/executors/hconcat.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/union.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-mem-engine/src/executors/hconcat.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":"crates/polars-mem-engine/src/executors/hconcat.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0e7591dff18b9986d1cb1d97f04484bbb19b2906b78a4256a44ae194087d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/sum_mean.rs:39-58 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:49-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/sum_mean.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-ops/src/chunked_array/list/sum_mean.rs:48\u0060 calls \u0060offsets\u0060, \u0060as_slice\u0060 and \u0060crates/polars-ops/src/chunked_array/array/sum_mean.rs:38\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/sum_mean.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4153b070793a87462f5912086df6de330fd16644d4cf1fc0a9fe5c0dfa5cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:173-177 | crates/polars-ops/src/chunked_array/binary/slice.rs:197-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 \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb71cc71deaa1250ad587dc8398e02774c7a6b183ece682c9810ca0d776a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/gather/chunked.rs:159-163 | crates/polars-ops/src/chunked_array/gather/chunked.rs:259-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/gather/chunked.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/gather/chunked.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdb3df76f6876a3008554dd854a85e3f9b5d26132ed83658a191ecf474572d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/dispersion.rs:38-42 | crates/polars-ops/src/chunked_array/list/sum_mean.rs:256-260 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/dispersion.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":"crates/polars-ops/src/chunked_array/list/dispersion.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd683e6100a3398c8c683c265bdc1a177494bb60d9363be92a11e477f36e40ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/escape_regex.rs:9-13 | crates/polars-ops/src/chunked_array/strings/normalize.rs:9-13 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/strings/escape_regex.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/escape_regex.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa95949a69b261ba1837e8c4aaa76ee76260e2adfaa4ca0e424890f3b6def09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/extract.rs:104-109 | crates/polars-ops/src/chunked_array/strings/extract.rs:129-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/extract.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"89da1b415660e308ffeeb3ff1f6e6032094f16739c5882a7ec4f66206940604a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/find_many.rs:224-232 | crates/polars-ops/src/chunked_array/strings/find_many.rs:321-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 \u0060crates/polars-ops/src/chunked_array/strings/find_many.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/find_many.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2190cc20777575e6516662149ca605a061b4eec67114e59f98c5ced94bc8327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/strings/substring.rs:308-312 | crates/polars-ops/src/chunked_array/strings/substring.rs:335-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 \u0060crates/polars-ops/src/chunked_array/strings/substring.rs:308\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/substring.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f1a8dd0cf05c73d59cb2806eb5488dacb193358b1b8638c050e87a020d676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:53-59 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:161-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4321347e72a59ed1007cdd64d93a81511d1f96b948b68987e0b144d586e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:276-282 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:386-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"725f204620982b925b75163fba84e5b44a57dd87864b0c1770bb330b3823bd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_inner.rs:63-68 | crates/polars-ops/src/frame/join/hash_join/single_keys_left.rs:131-135 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_inner.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_inner.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9137c7a89aad058f1e5be643a41f93bbd7f9f89aa90c59861ed44ae324ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/series/ops/abs.rs:19-23 | crates/polars-ops/src/series/ops/negate.rs:16-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/abs.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/abs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c233041f806d29fe74ac2d611e2ba98b7c2bafec46e8cea475370afb03afaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/series/ops/various.rs:169-174 | crates/polars-ops/src/series/ops/various.rs:205-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":"crates/polars-ops/src/series/ops/various.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2581cd3ac27e25e5de4c48ab663aee8911c58ea7d51a15f0ac3a3e20d52dda53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/mod.rs:46-51 | crates/polars-parquet/src/arrow/read/deserialize/mod.rs:96-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/arrow/read/deserialize/mod.rs:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd55e1162583c6bbe77aa213dc6082e1e75dfb55476ceadfd7ca1ef5c0e343f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:507-511 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:726-730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.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":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e28901aa0b4ae1061cf5926ddf2a00af7dacd904bdf60f4554b8f09879ec8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:764-769 | crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs:780-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/handwritten_thrift/file_metadata_thrift.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e94afef3c1d24df227f02a39beb7423220f139192a486c59a34517977dba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs:201-205 | crates/polars-plan/src/plans/conversion/type_coercion/membership.rs:294-299 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/sql.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b4b4bb8b775083aab8688af8d6cc8a64abe190524d3077de311a8de48a0c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/ir/format.rs:523-528 | crates/polars-plan/src/plans/ir/tree_format.rs:33-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2c906e5f7a6be57b25bc22ca61d6099d93604b20d204e3bf8a2ead5057674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs:162-166 | crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs:181-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs:162\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/dynamic.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b22a62f034c7a147d7f41f03b096b2124a1b378e38a22cc1b575807a5d25efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-python/src/cloud_server.rs:78-82 | crates/polars-python/src/lazyframe/general.rs:78-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/cloud_server.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/cloud_server.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1fa662f8cfd12132ead1f73891f735eeedce94b1e05bf350decf6fe71cdac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1714-1718 | crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1731-1735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1714\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"361d63a8f947e6324c1c0569c46c14c98ee14e634f87686fab7a4dee738020ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-python/src/lazyframe/visitor/nodes.rs:805-810 | crates/polars-python/src/lazyframe/visitor/nodes.rs:818-822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/lazyframe/visitor/nodes.rs:805\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"838f3f802c0d575bacc742def61a9463fe7c7e602baa340df7c11e3c6cac9f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-row/src/variable/no_order.rs:66-71 | crates/polars-row/src/variable/utf8.rs:92-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 \u0060crates/polars-row/src/variable/no_order.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-row/src/variable/utf8.rs:98\u0060 calls \u0060add\u0060 and \u0060crates/polars-row/src/variable/no_order.rs:72\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9cc85aff10dda0a27b4c2887aeb556646b25f35fea923a0e0cccc36c2e09ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-sql/src/subquery.rs:371-376 | crates/polars-sql/src/subquery.rs:2020-2025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba3fecb8250e3b9a6915ec15f150c0456a661f1786126a796da60536c4cbc3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/polars-stream/src/nodes/dynamic_slice.rs:122-126 | crates/polars-stream/src/nodes/joins/in_memory.rs:112-115 | crates/polars-stream/src/nodes/repeat.rs:103-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_slice.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-stream/src/nodes/dynamic_slice.rs:121\u0060 calls \u0060is_none\u0060 and \u0060crates/polars-stream/src/nodes/repeat.rs:102\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_slice.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a123a6f7c6994128bbfef85ece0df4ef716c0a17485c42a5a5580f71672e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:2580-2584 | crates/polars-stream/src/physical_plan/lower_expr.rs:2613-2617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:2580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd045b80ecf12a359a3e94362cfd8a324cb7233b07ac9a8a1481745b91c017fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-time/src/series/mod.rs:181-186 | crates/polars-time/src/series/mod.rs:205-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/series/mod.rs:181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/series/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2aaf64b037b4e2e4f23c24e7bb8ad06a65ca86d6002fec69c89b51a475feea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-time/src/windows/group_by.rs:366-370 | crates/polars-time/src/windows/group_by.rs:441-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/windows/group_by.rs:366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"db82eb7f20e54e3329005030ddfb64f8a0fa09c998953be4907b0a524d1b6f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/polars-compute/src/propagate_nulls.rs:7-23 | crates/polars-compute/src/trim_lists_to_normalized_offsets.rs:7-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/propagate_nulls.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a271eb4b6af98dafb5f946b395c879253d2b90a5749e47fc5958f9af5d66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/trigonometry.rs:25-44 | crates/polars-plan/src/plans/aexpr/function_expr/trigonometry.rs:24-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/trigonometry.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ba4e6e0d0a64dbb13302e0d6ec5c6f7b0c71632ef876e3351ddab92c1133eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-arrow/src/array/iterator.rs:76-85 | crates/polars-arrow/src/bitmap/iterator.rs:544-553 | crates/polars-buffer/src/buffer.rs:524-533 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/buffer.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5e2a4be58a6f137be9c09bc36dae06e02fb4dd7e99107c30d13ab0ed3a444c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-arrow/src/array/primitive/mod.rs:258-266 | crates/polars-core/src/chunked_array/object/mod.rs:184-192 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/object/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabb1946d1ab364e0b9f5be6bbb745b50365f6cc8bb7efdca560f6ae783f85c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/ewm/mean.rs:97-103 | crates/polars-compute/src/ewm/sum.rs:68-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/mean.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9893fc869c224db9325fa055c1c81470e2226f903acab5b787bb467f44856e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-core/src/chunked_array/array/iterator.rs:225-232 | crates/polars-core/src/chunked_array/list/iterator.rs:559-566 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6621c0a8a8aa45958ce2d42e99130e18ecd1df731087390f639c74f11dc1eeb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-core/src/chunked_array/builder/list/boolean.rs:23-33 | crates/polars-core/src/chunked_array/builder/list/primitive.rs:91-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/builder/list/boolean.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3847ec3c92d042907ca8c6a6e3429bf3c407b11d177a32c8b0a9268423d00f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-core/src/chunked_array/mod.rs:667-672 | crates/polars-core/src/frame/column/mod.rs:548-553 | crates/polars-core/src/frame/dataframe.rs:219-224 | crates/polars-core/src/series/mod.rs:373-378 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb82dd32f6bbf4c574284cab098b3b45829e14d23de659f3c0c3e9b4d413ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/chunked_array/temporal/date.rs:7-11 | crates/polars-time/src/chunkedarray/date.rs:6-10 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/date.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cca604c47f4f5c1339849d46b56bb3d490aabd2cddabd26f1711d644902eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-core/src/datatypes/extension/generic.rs:46-51 | crates/polars-python/src/extension.rs:81-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/extension/generic.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"547047f1ad497eedff92eca0068f725c053a3aa38b93faf1779c68179605a30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-expr/src/reduce/skew_kurtosis.rs:101-107 | crates/polars-expr/src/reduce/skew_kurtosis.rs:168-174 | crates/polars-expr/src/reduce/var_std.rs:75-81 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/skew_kurtosis.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0cd6a26cab1667dcaa79c82fa52cb0a7b5134fc98e3c015fe35462bb3516a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/namespace.rs:19-26 | crates/polars-ops/src/chunked_array/list/namespace.rs:17-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/namespace.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cd21e6a0d1a1d176a51ce1ef5f62259157215c6157ae4beead0df5139b1d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-parquet/src/parquet/statistics/binary.rs:29-40 | crates/polars-parquet/src/parquet/statistics/fixed_len_binary.rs:51-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/statistics/binary.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"109cb30c14e23d1e669f893394c38294381bc8e44c4035626d33a5e2abe0a607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/binning.rs:77-83 | crates/polars-plan/src/plans/aexpr/function_expr/binning.rs:39-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/binning.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"255ff9f3ee58ded7784ee3a6bf0b09d9b9f7a56682df9f6dbd17106752dcf584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/dsl/options/mod.rs:182-191 | crates/polars-plan/src/plans/options.rs:355-364 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/mod.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe27c8495e71c5067df4301991e6303f037a18c5ce2cba3342e05555f3eca6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-plan/src/dsl/options/mod.rs:193-202 | crates/polars-plan/src/plans/options.rs:366-375 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bddb2f66fbe083394aa988c572e7e1473b23b0d431a381f45f0006dd8cc90c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/nodes/columnar_function.rs:124-130 | crates/polars-stream/src/nodes/in_memory_map.rs:80-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/columnar_function.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba764d6f5f97b284585050a8aeb03db5395b2bbd5a4dc1748b6a6b8b90f060cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): crates/polars-stream/src/nodes/cum_agg.rs:54-59 | crates/polars-stream/src/nodes/ewm.rs:33-37 | crates/polars-stream/src/nodes/filter.rs:31-35 | crates/polars-stream/src/nodes/forward_fill.rs:49-53 | crates/polars-stream/src/nodes/gather_every.rs:42-46 | crates/polars-stream/src/nodes/map.rs:28-32 | crates/polars-stream/src/nodes/rle_id.rs:40-44 | crates/polars-stream/src/nodes/select.rs:46-50 | crates/polars-stream/src/nodes/simple_projection.rs:41-45 | crates/polars-stream/src/nodes/sorted_unique.rs:61-65 | crates/polars-stream/src/nodes/with_row_index.rs:38-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 all 11 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/cum_agg.rs:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/cum_agg.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec365ca33c899e7e55dc76cf84d486bb9b6b3162b5276669d1caadbaabcd43d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-stream/src/nodes/group_by/tuning.rs:24-30 | crates/polars-stream/src/nodes/joins/tuning.rs:17-23 | crates/polars-stream/src/nodes/window/tuning.rs:18-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/tuning.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d39a0547a961fd342a1f1acdbd77e4f0aa9ff069c0edb684c6078ab303b9f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/nodes/in_memory_source.rs:118-122 | crates/polars-stream/src/nodes/joins/mod.rs:136-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_source.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e29f833c9172d453abe501fe94c86cdb2f91d60cb7c83fa5a5c64b7d0a6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:88-97 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:82-91 \u2014 \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"303a5c7cc66cd5a8ffc33a3543ce02f5eb7474d1e1bd8b6f0c101ff692c9b849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:298-308 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:225-235 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d52be8971ab201080c2ff768e711a9ce45da05dce3c3c63ec05d2f5e272d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:478-489 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:480-491 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs:478\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"553822117dc370c8108aeb0cacf58c07b08f300e9b7d686a86f54667a6d34308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-compute/src/binview_index_map.rs:42-48 | crates/polars-utils/src/idx_map/bytes_idx_map.rs:51-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/binview_index_map.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"956a923f53930b5b8326a3b0a7d29ec54aa25fb53a685c917877367b4a939c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-compute/src/cast/binary_to.rs:103-110 | crates/polars-compute/src/cast/utf8_to.rs:57-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 \u0060crates/polars-compute/src/cast/binary_to.rs:103\u0060 it begins part-way through the construct above it, so those exact 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 \u0060from\u0060 to \u0060\u0026BinaryArray\u003Ci64\u003E\u0060 in one and \u0060\u0026Utf8Array\u003Ci64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/binary_to.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd9beca44641d7bb1b6eddc96eba4568dc0e39d17283650930c4639ec45550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-expr/src/reduce/any_all.rs:110-114 | crates/polars-expr/src/reduce/any_all.rs:209-213 | crates/polars-expr/src/reduce/has_nulls.rs:102-106 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/any_all.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c0d85725e31129b67c40682fb9302a40628249d0372854453bb61dff2e9405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/polars-ops/src/chunked_array/array/namespace.rs:87-92 | crates/polars-ops/src/chunked_array/array/namespace.rs:94-99 | crates/polars-ops/src/chunked_array/list/namespace.rs:215-220 | crates/polars-ops/src/chunked_array/list/namespace.rs:222-227 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/namespace.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c392cfab421363c91d9dd0bd7e694d1df36badf653c03c885399e3e3825818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-ops/src/chunked_array/binary/slice.rs:59-67 | crates/polars-ops/src/chunked_array/strings/substring.rs:162-170 \u2014 before extracting anything, compare \u0060crates/polars-ops/src/chunked_array/binary/slice.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/strings/substring.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/slice.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/slice.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ca31839a4cd815b4fc3273b65730b8669f6b539721c488f703d34212f973c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-plan/src/dsl/array.rs:189-195 | crates/polars-plan/src/dsl/list.rs:271-277 | crates/polars-plan/src/dsl/list.rs:279-285 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/array.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a98398daec08db3fe42e3a478695a52ebb1bb9ef5d9a0bb49dec84783b71fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/business.rs:17-25 | crates/polars-plan/src/plans/aexpr/function_expr/business.rs:38-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut fmt::Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/business.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b8eb978806e029969d31e3659b26b7f94f96794232c352c5fc6b697c5f30f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/extension.rs:12-18 | crates/polars-plan/src/plans/aexpr/function_expr/extension.rs:32-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/extension.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb9cfd78ba4c89d50d019e2c7e606a6088a813a523b328cfd9e342baa258330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/pow.rs:13-20 | crates/polars-plan/src/plans/aexpr/function_expr/pow.rs:24-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060f\u0060 to \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut fmt::Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/pow.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e67a91e4ec594b19902b91aac581ccc2dcad5fa2a7a7a7e9d71e3766c51fa02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/polars-plan/src/dsl/function_expr/rolling_by.rs:18-33 | crates/polars-plan/src/plans/aexpr/function_expr/rolling_by.rs:17-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/rolling_by.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d5558f3e6f2da86e3723c5e6a3b22f9cf443c30b83cc1f352e1ebe8d7e0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/dsl/options/delta_sink_state.rs:54-60 | crates/polars-plan/src/dsl/options/iceberg_sink_state.rs:86-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/delta_sink_state.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e81c1a06f97e5407b4a0a8c597a5488bf0c90f8a26017df770fbdbf8bfea225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-sql/src/catalog.rs:653-657 | crates/polars-sql/src/sql_visitors.rs:510-514 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"460dc01328eb63de082168f82c0ca8d96cf4c7a5d177fe597c9bbafb7ddd6c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-time/src/base_utc_offset.rs:14-22 | crates/polars-time/src/dst_offset.rs:11-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/base_utc_offset.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/base_utc_offset.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d26a28bdc23461ffc1bfbe97573305939ea28957937418409ace49d5b137d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-ops/src/series/ops/clip.rs:38-52 | crates/polars-time/src/replace.rs:56-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/clip.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":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbc75767ce733938aba9b60a10f9dcc3f90c2582cd0d4b46f1909bb0c39dfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-ops/src/series/ops/replace.rs:35-47 | crates/polars-ops/src/series/ops/replace.rs:80-97 | crates/polars-ops/src/series/ops/replace.rs:139-151 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/replace.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/replace.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"05423c1823ac5e70038ca7312625fde3e33294a825d4562f77de0ab681229f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:63-80 | crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs:57-74 \u2014 \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ndjson/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/csv/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"979a37c82978e3a327daec0cd9a8b2c985010014f9ab8069d83af62dcf912b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:76-91 | crates/polars-stream/src/nodes/io_sources/lines.rs:64-79 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:71-86 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/lines.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 \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0ae65883536aec7c6384f621c9eee200e2173be988870541c500eb2cb7ef07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:242-256 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:342-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"59706aeff5335bb4c257cab7230e28593f602367fafe74ab6d36358e9d3360a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:540-560 | crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:568-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/schema/io_message/from_message.rs:540\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/schema/io_message/from_message.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c0bbc56a2007895606969f294ad4c2ebb71ee6dc3fec1332e2e6305aa63d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/polars-expr/src/reduce/skew_kurtosis.rs:62-75 | crates/polars-expr/src/reduce/var_std.rs:34-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/skew_kurtosis.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/skew_kurtosis.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc777dcca4a4f2f3e1b7fb6bc4320b172a8baff597d173bf9fa6a99100f50142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:244-256 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:272-284 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:344-356 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0a5c073057618e64780731589e027d76c24cec35bd0081c6e0f9062c440fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/polars-io/src/file_cache/entry.rs:96-108 | crates/polars-io/src/file_cache/entry.rs:123-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/entry.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0222ef5007313535e13d2871d9d0e35f585b2cb1b98268e5fa2322bb5d96bb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/polars-io/src/csv/write/write_impl.rs:69-80 | crates/polars-io/src/csv/write/write_impl.rs:89-100 | crates/polars-io/src/csv/write/write_impl.rs:109-120 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/write/write_impl.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":"crates/polars-io/src/csv/write/write_impl.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42daa96bb3b41c6bbb000995e2eb887ae30363115e558fc1a862cf5a7ca7e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1994-2005 | crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:2011-2022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/lazyframe/visitor/expr_nodes.rs:1994\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"1951d71b4005a0a671a139001a5089f00e227ccfb531c02bdce2699bf4a2758b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:662-673 | crates/polars-plan/src/plans/aexpr/schema.rs:930-941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:662\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a926a9cfa8b0a3dc24bb7c506ef73f85f0e189022076fd109ba70ecf4d7c8450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/polars-expr/src/idx_table/binview.rs:200-211 | crates/polars-expr/src/idx_table/row_encoded.rs:167-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 \u0060crates/polars-expr/src/idx_table/binview.rs:200\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2272b99ff0683dbe90a5553d492724fd3858ac0ae43c3e2e1300f1decc37ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:374-384 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:455-465 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:495-505 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:374\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0705ff7cf304f80e23434bf48ef78b2afb94b6a40936b6c739a32c49fc3c69b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-io/src/csv/write/write_impl/serializer.rs:275-285 | crates/polars-io/src/csv/write/write_impl/serializer.rs:309-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"457e3e7ff2550e48e67f3185603ad7de744894e86818ad5f3b7214dc35b059fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/polars-python/src/sql.rs:173-183 | crates/polars-python/src/sql.rs:259-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/sql.rs:173\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-python/src/sql.rs:185\u0060 calls \u0060set_item\u0060, \u0060Wrap\u0060 and \u0060crates/polars-python/src/sql.rs:271\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6584a7c28b3951fc364bba5f6f5f5b77dfb584fc10176ce883496c58736b1cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/polars-ops/src/frame/join/asof/groups.rs:237-247 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:94-104 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:197-207 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:323-333 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/asof/groups.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/groups.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"032e8a145519f90de20113d236176f816f770edb3c7253851b70d6c22d40b3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/polars-io/src/csv/write/write_impl/serializer.rs:212-222 | crates/polars-io/src/csv/write/write_impl/serializer.rs:244-254 | crates/polars-io/src/csv/write/write_impl/serializer.rs:278-288 | crates/polars-io/src/csv/write/write_impl/serializer.rs:311-321 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-io/src/csv/write/write_impl/serializer.rs:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-io/src/csv/write/write_impl/serializer.rs:275\u0060 calls \u0060clear\u0060 and \u0060crates/polars-io/src/csv/write/write_impl/serializer.rs:209\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73352988d7df10b6e2e38b1cb69dcdfbf17e4ed8838a0d95a26c20bfb807657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/polars-plan/src/plans/aexpr/schema.rs:663-673 | crates/polars-plan/src/plans/aexpr/schema.rs:733-743 | crates/polars-plan/src/plans/aexpr/schema.rs:931-941 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd266457b608a69fce18926d60033a9b5961cc40a2ca63829202fd09065972a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-python/src/dataset/dataset_provider_funcs.rs:129-138 | crates/polars-python/src/dataset/dataset_provider_funcs.rs:139-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/dataset/dataset_provider_funcs.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/dataset/dataset_provider_funcs.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4491032bccbd814d9a68314ad513680f8f9beb766e930d555b983342b91e0e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:375-384 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:456-465 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:496-505 | crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:665-674 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs:375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/chunkedarray/rolling_window/dispatch.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a6aa2ee3adfeccfdc6109098d3cfac9ea3f4378d0c9e2e7032149143d523b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/polars-json/src/json/write/serialize.rs:421-430 | crates/polars-json/src/json/write/serialize.rs:443-452 | crates/polars-json/src/json/write/serialize.rs:465-474 | crates/polars-json/src/json/write/serialize.rs:486-494 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-json/src/json/write/serialize.rs:421\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/write/serialize.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24dd64a79f614d12fb66a89ed9f4bf6be6d11221791f013e16186c63e66b00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-python/src/sql.rs:229-238 | crates/polars-python/src/sql.rs:244-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/sql.rs:229\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ad9a5a4544619dde0efc539682c887b0ad53252547cc8fecb9803bbd5bd1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/polars-io/src/file_cache/eviction.rs:234-243 | crates/polars-io/src/file_cache/eviction.rs:246-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/file_cache/eviction.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b937645b996e56bb8abc4cb565ecc39797a22d7363c5599e173f4dca905acf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/polars-python/src/dataset/dataset_provider_funcs.rs:129-138 | crates/polars-python/src/dataset/dataset_provider_funcs.rs:139-148 | crates/polars-python/src/dataset/dataset_provider_funcs.rs:149-158 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/dataset/dataset_provider_funcs.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/dataset/dataset_provider_funcs.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4f4e45955680a050fb69c277ddc08ffa244cc7a81938f154f47b2de64cf6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/dispatch/struct_.rs:78-86 | crates/polars-expr/src/dispatch/struct_.rs:95-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/struct_.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd36c553117983d443db557f1fe78567ba5901fd5114255347dad85832ff9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/polars-stream/src/nodes/io_sources/csv/builder.rs:66-74 | crates/polars-stream/src/nodes/io_sources/lines.rs:54-62 | crates/polars-stream/src/nodes/io_sources/ndjson/builder.rs:61-69 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/lines.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 \u0060crates/polars-stream/src/nodes/io_sources/csv/builder.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":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83fe5ee5080ff24c10d7d4b45c3a375ed7251045ca9d72f5c78075ff2015a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-stream/src/nodes/joins/equi_join/mod.rs:504-512 | crates/polars-stream/src/nodes/joins/semi_anti_join.rs:506-514 \u2014 before extracting anything, compare \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/equi_join/mod.rs:504\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd760bc9df2ed3b4a7fd96c59b464270c1ec14bad72a1a1f937228e6f14b0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/plans/ir/format.rs:360-368 | crates/polars-plan/src/plans/ir/format.rs:376-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/ir/format.rs:360\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4962b09668a51dda3ca599f0048c7079a7d90eb70fe279a09c4b698dbb676fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-expr/src/dispatch/horizontal.rs:66-74 | crates/polars-expr/src/dispatch/horizontal.rs:114-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 \u0060crates/polars-expr/src/dispatch/horizontal.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":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c8296377ea6140917708be642ee905934e0f1d07a3a6bef1518a7bd3d8238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/polars-python/src/sql.rs:157-165 | crates/polars-python/src/sql.rs:293-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-python/src/sql.rs:157\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39895714459f6530f88e662005ae25976d588cc2f59f5fcd7174be4b3b42cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/polars-ops/src/chunked_array/binary/namespace.rs:122-129 | crates/polars-ops/src/chunked_array/binary/namespace.rs:155-162 | crates/polars-ops/src/chunked_array/binary/namespace.rs:174-181 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/binary/namespace.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/namespace.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b855a5be2f1896b3ea78468fce074f2327026d3278a2ed773ee734892976f750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-ops/src/chunked_array/list/namespace.rs:240-247 | crates/polars-ops/src/chunked_array/list/namespace.rs:415-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ce2c04533dc9de91564a37f35318a01d33f49624fd1df964e673a0e33ab5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs:72-79 | crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs:85-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"648fefa6c94dfb77aea2416d19166c9ded37fa10f327a2172e11db5fc0a3e906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/dispatch/horizontal.rs:18-24 | crates/polars-expr/src/dispatch/horizontal.rs:60-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/horizontal.rs:18\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a116fa824a371f64ed6ca6f9e0d44d8a440d32f344a9e472b2c71b5d3f3820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/polars-ops/src/chunked_array/list/namespace.rs:242-249 | crates/polars-ops/src/chunked_array/list/namespace.rs:417-424 | crates/polars-ops/src/chunked_array/list/namespace.rs:491-498 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/list/namespace.rs:242\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ce2e52e6ec541ecc37dbf44bb19e7c8441bd77ea63918f519a409b2f2ad166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/polars-expr/src/expressions/ternary.rs:193-200 | crates/polars-expr/src/expressions/ternary.rs:209-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/expressions/ternary.rs:193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"22587c7b6fa636a88027c1c576567b8fb2f51f0ea2aa39877ac34c85da8de020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/plans/ir/tree_format.rs:297-304 | crates/polars-plan/src/plans/ir/tree_format.rs:359-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/ir/tree_format.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cb1324e4c79b6eeecb14fc0bc3a9f9a4212362990675a4c6d2a9dc81f2707d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/polars-ops/src/series/ops/clip.rs:88-95 | crates/polars-ops/src/series/ops/clip.rs:124-131 | crates/polars-time/src/offset_by.rs:47-54 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/clip.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a945919c02ed508ce48a9d912712ed562fe1aecf69f044767ae3f779800b50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:340-346 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:348-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7827e713e1e24d001f5388a357fb971c5506a3e19bda856dd684ee9c238850c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-stream/src/physical_plan/lower_expr.rs:2108-2114 | crates/polars-stream/src/physical_plan/lower_expr.rs:2582-2588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/lower_expr.rs:2108\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd89c2c4ececcef3805e1ee1f3fe23074de55dd0ad84a709b222a9e37606fcae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): docs/source/src/rust/user-guide/io/csv.rs:6-12 | docs/source/src/rust/user-guide/io/json.rs:3-9 | docs/source/src/rust/user-guide/io/parquet.rs:5-11 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"docs/source/src/rust/user-guide/io/csv.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9f9522dc7f57a938b92555fe15945bdf7a7cb8ecea1da87b6e21ab64b1373f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/polars-ops/src/chunked_array/array/sum_mean.rs:97-103 | crates/polars-ops/src/chunked_array/array/sum_mean.rs:133-139 | crates/polars-ops/src/chunked_array/array/sum_mean.rs:141-147 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/sum_mean.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/sum_mean.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a300ec47a4587acb6310dd4dbeacf1392ddb39d12d4c2e233a4a68ef1bf2b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:104-109 | crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:417-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/function_expr/schema.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29e48f8b2ab6c1b557c279ad3af6cf9cb61dd801028c70100a5ccdaa48b3084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/dispatch/misc.rs:285-290 | crates/polars-expr/src/dispatch/misc.rs:303-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/misc.rs:285\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/misc.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff73a215f671873d17839d6ecfe31b03213d387f6e8d5401cc58bb0860355b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:235-239 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:333-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 \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:231\u0060 calls \u0060needs_checks\u0060, \u0060hash_join_inner\u0060 and \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:331\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83c5d066db1c526ca7f5987c5d7b94c4b8b534065abf8061055c12500364992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/plans/ir/format.rs:738-743 | crates/polars-plan/src/plans/ir/format.rs:748-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 \u0060crates/polars-plan/src/plans/ir/format.rs:738\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ec3544adcd9a98d968fdc158cbc822922ec4d3ffac1ce6e24ce683b088ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-expr/src/dispatch/strings.rs:297-301 | crates/polars-expr/src/dispatch/strings.rs:310-314 | crates/polars-expr/src/dispatch/strings.rs:323-327 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/strings.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf5e39549736217cbd6a6cd0765b770be3cac31121f14499ee647738fddc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/dsl/functions/concat.rs:109-113 | crates/polars-plan/src/dsl/functions/concat.rs:121-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/functions/concat.rs:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/functions/concat.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64f53f27d4f8ecf75273f26f839bd4656b43cdb676ae5fb9d9afc1965a597fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/utils/supertype.rs:269-273 | crates/polars-core/src/utils/supertype.rs:290-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3659fd0aafe51ecc5490d123e243a03f989b905e65ba71c07f7be684f1eb06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/source/src/rust/home/example.rs:5-9 | docs/source/src/rust/user-guide/concepts/lazy-vs-eager.rs:16-20 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"docs/source/src/rust/home/example.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d426f23e008035b33201527db4612aa406521cba276e399b46a501c04cd832b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-core/src/utils/supertype.rs:261-265 | crates/polars-core/src/utils/supertype.rs:310-314 | crates/polars-core/src/utils/supertype.rs:317-321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-core/src/utils/supertype.rs:268\u0060 calls \u0060is_integer\u0060, \u0060is_bool\u0060, \u0060Some\u0060 and \u0060crates/polars-core/src/utils/supertype.rs:317\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6855ebacb490a0cab70d910f59bd4943accfdca48ae7db15d8fbcc5b4c82076b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-sql/src/types.rs:63-67 | crates/polars-sql/src/types.rs:221-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/types.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb0ce6963a54dfcd8edf15626c81e398eb5d65d63fc9ce6e3096ada867bd18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:176-180 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:182-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f98fae6855cbe4966aac37ae3f894d88cbf9ac017a44b20b4db8163e116d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/ewm/cov.rs:149-153 | crates/polars-compute/src/ewm/cov.rs:177-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-compute/src/ewm/cov.rs:182\u0060 calls \u0060sqrt\u0060 and \u0060crates/polars-compute/src/ewm/cov.rs:154\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/cov.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af8dbc1eee673676d3e43827a259faeb4105d388fa5284a8450dec58822d3fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/min_max/simd.rs:108-112 | crates/polars-compute/src/min_max/simd.rs:132-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/min_max/simd.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-compute/src/min_max/simd.rs:114\u0060 calls \u0060get_simd\u0060 and \u0060crates/polars-compute/src/min_max/simd.rs:138\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/min_max/simd.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb8b6ad8d498f9750691280ba392a3dbfbef998016f52423451ae1007e979f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-compute/src/unique/distinct.rs:391-395 | crates/polars-compute/src/unique/distinct.rs:449-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-compute/src/unique/distinct.rs:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/distinct.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"822e03e49df59c03091944d410c18d1b8ee954b5331a81d345aae097a4102499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/frame/mod.rs:2319-2323 | crates/polars-core/src/frame/mod.rs:2350-2354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-core/src/frame/mod.rs:2319\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c04fd3df8146d04c68b24eefc1a42649a458830f786b2811cf7bdeeb72cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/hashing/vector_hasher.rs:55-59 | crates/polars-core/src/hashing/vector_hasher.rs:129-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/hashing/vector_hasher.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd81cfa8b0da566300aec72b86c95e82bdee8680e84cd6cd91f2770681e0e2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-core/src/utils/supertype.rs:353-357 | crates/polars-core/src/utils/supertype.rs:361-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"511d17c3910af3b6ec1a61234951d6d0bdd0daea379d16dfbb5daf375b333b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-expr/src/dispatch/groups_dispatch.rs:364-370 | crates/polars-expr/src/dispatch/groups_dispatch.rs:855-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/groups_dispatch.rs:364\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5dd5545775f8c64d115be3255df75fd4a46bf5029f6b3c213af39435f98f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/dispatch/range/linear_space.rs:292-296 | crates/polars-expr/src/dispatch/range/linear_space.rs:307-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/range/linear_space.rs:292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509eef27fe8387aa360b40eb01243152535bed7b5f33d996e0b76201934fe27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/dispatch/range/utils.rs:47-51 | crates/polars-expr/src/dispatch/range/utils.rs:75-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/dispatch/range/utils.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/utils.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"864cab50b59bf18be262bfbf2e3db7671b19318868def2bd9928b951890d2d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-expr/src/reduce/bitwise.rs:239-243 | crates/polars-expr/src/reduce/min_max.rs:518-522 | crates/polars-expr/src/reduce/min_max.rs:634-638 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/bitwise.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/bitwise.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab7ef95802e061d4df1389fcc805083111fd5437981317e5da03f5f3bd37c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/reduce/bitwise.rs:196-200 | crates/polars-expr/src/reduce/min_max.rs:591-595 \u2014 before extracting anything, compare \u0060crates/polars-expr/src/reduce/bitwise.rs\u0060 and \u0060crates/polars-expr/src/reduce/min_max.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/bitwise.rs:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/bitwise.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"50754c6c9d54ffcb71aaf8ac1749500500a7631f255582a95274580a55936345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-expr/src/reduce/cov.rs:81-86 | crates/polars-expr/src/reduce/cov.rs:225-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/cov.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/cov.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5003022caf2599ad04f4f635270c24c7e9f91aef65e474408255054efb189a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/reduce/first_last.rs:426-430 | crates/polars-expr/src/reduce/first_last_nonnull.rs:411-415 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/first_last.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"340f6b6e96c9518d95c67850451b8a29b8dc5f43f0608b0550e71b5948b9e300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-expr/src/reduce/first_last.rs:455-459 | crates/polars-expr/src/reduce/first_last_nonnull.rs:447-451 | crates/polars-expr/src/reduce/implode.rs:357-361 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-expr/src/reduce/first_last.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec51a2f1bcc19a91f7c560a11209d43258c1b6b63eea29e4e1f551284e6edd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-expr/src/reduce/mod.rs:546-550 | crates/polars-expr/src/reduce/mod.rs:800-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d476dff64d75f51505f1854282003f7563d20f0d07f2145e07d67828058dbe73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-json/src/json/deserialize.rs:44-50 | crates/polars-json/src/json/deserialize.rs:392-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-json/src/json/deserialize.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09574de100ac126973f12c7f4c9f0e8dc9cb2fe0057b295fa9d6a902ef99b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/dispersion.rs:123-127 | crates/polars-ops/src/chunked_array/list/dispersion.rs:99-103 \u2014 \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs\u0060 and \u0060crates/polars-ops/src/chunked_array/list/dispersion.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/chunked_array/array/dispersion.rs:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d4acc92c55fe88ee79fd63f9befd0e2604ce45987db7b3f2a8b062a169fcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-ops/src/chunked_array/array/get.rs:93-98 | crates/polars-ops/src/chunked_array/list/get.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 \u0060crates/polars-ops/src/chunked_array/array/get.rs:93\u0060 it does not close everything it opens, so those exact 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 \u0060ca\u0060 to \u0060\u0026ArrayChunked\u0060 in one and \u0060\u0026ListChunked\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/get.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2f5b5a6432b8c3ef4f204bbba17eed766eae34e8b0a75ad1da319404cb42d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/frame/join/asof/default.rs:130-134 | crates/polars-ops/src/frame/join/asof/default.rs:137-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/default.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbb5bfbd291c28520edc07f6e16f5bca232953ef0a6f9b63c4f1afb71d66e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:88-92 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:191-195 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:317-321 | crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:412-416 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys_dispatch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd60b293957b89351be7d9fdbd6377ebe0ca4b6769c182405f0d89f456b3a449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:225-229 | crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:327-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:231\u0060 calls \u0060needs_checks\u0060, \u0060hash_join_inner\u0060 and \u0060crates/polars-ops/src/frame/join/hash_join/sort_merge.rs:333\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/sort_merge.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd7ad24e153879e585b7fa493fbb42da5997224920830b4260065800638b07a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-ops/src/series/ops/fused.rs:45-49 | crates/polars-ops/src/series/ops/fused.rs:96-100 | crates/polars-ops/src/series/ops/fused.rs:146-150 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/fused.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/fused.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ddeb74f867f61c66fb2827d0d998c4277efe2945d348ffbdf19d2d03dc2263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-ops/src/series/ops/int_divide.rs:88-92 | crates/polars-ops/src/series/ops/search_sorted.rs:89-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-ops/src/series/ops/int_divide.rs:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/int_divide.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e295457ea850f595eaf75cb3c54390c7458e64cdd0fafcec14a007215628894c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs:96-100 | crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs:179-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs:184\u0060 calls \u0060with_capacity\u0060, \u0060collect_n\u0060 and \u0060crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs:101\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/delta.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8972f0f1cbe28c6c3b3e359e60d24e29080eeb66a3c75a0f90c194d9c8aeaf3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-parquet/src/parquet/encryption/modules.rs:58-62 | crates/polars-parquet/src/parquet/encryption/modules.rs:77-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encryption/modules.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b085aaf9f8a6f003bdc85765388121e9ad90e51c3e0aed29d81778d56c9f3db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-parquet/src/parquet/write/file.rs:359-363 | crates/polars-parquet/src/parquet/write/file.rs:385-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-parquet/src/parquet/write/file.rs:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/polars-parquet/src/parquet/write/file.rs:365\u0060 calls \u0060Some\u0060, \u0060serialize_column_index\u0060 and \u0060crates/polars-parquet/src/parquet/write/file.rs:390\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/file.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"759f9136220c364eca4559546ba06cadb069f2bb5f3d7c38bda8dd8eafc36f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-plan/src/dsl/selector.rs:643-647 | crates/polars-plan/src/dsl/selector.rs:684-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/dsl/selector.rs:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/selector.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f90d2531e7739ca5c590ac82724598471d76db6147dd8d63b98a4e755ef1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/aexpr/schema.rs:653-658 | crates/polars-plan/src/plans/aexpr/schema.rs:726-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-plan/src/plans/aexpr/schema.rs:653\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da533d9d7e83c740f835b2a53cde3d432f07729bab2e1d4686e668c0313bcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-plan/src/plans/conversion/stack_opt.rs:140-145 | crates/polars-plan/src/plans/optimizer/stack_opt.rs:90-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0bfdbb1f37cde051e134bab6314e5c655cb20e10c14396dcab05b48a877d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-python/src/functions/io.rs:135-139 | crates/polars-python/src/functions/io.rs:165-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/io.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85abfcdd34d098297e546d157a81ca58ac1d221e0a97e65ccb28aea0a775182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-row/src/variable/no_order.rs:61-65 | crates/polars-row/src/variable/utf8.rs:86-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/variable/no_order.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/no_order.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"928f88223b0621fc687735009839979bde42073fa440bb8a560a0f519395383e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-row/src/variable/utf8.rs:329-333 | crates/polars-row/src/variable/utf8.rs:353-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-row/src/variable/utf8.rs:329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/polars-row/src/variable/utf8.rs:349\u0060 calls \u0060push\u0060, \u0060zeroed\u0060 and \u0060crates/polars-row/src/variable/utf8.rs:325\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/utf8.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a8015fe79032e2ddf6d7f5a2e8a6a8c76c7dae47a31d3dc6343f5681afb699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/polars-sql/src/context.rs:8372-8378 | crates/polars-sql/src/context.rs:8546-8552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-sql/src/context.rs:8372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":8372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4af9195ad9c42c76bb2d0925a3c8c4a93730a40fedcac0afb23326c7a4a9a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/polars-stream/src/nodes/cum_agg.rs:69-73 | crates/polars-stream/src/nodes/ewm.rs:47-51 | crates/polars-stream/src/nodes/rle_id.rs:54-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/cum_agg.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caec3eaccfb3b5bbbdd7fc51553d971d5fec60aba277b549ecf7f6fe6c90e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/nodes/dynamic_slice.rs:81-85 | crates/polars-stream/src/nodes/repeat.rs:73-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/dynamic_slice.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_slice.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff3e2f7f5b707aac6cdbe727b0ab216e2281be2628f2cf06d2b345ab591ab37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs:563-567 | crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs:573-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae5d106830672f314a5d76cd05273bd59bfc90887ea747848e05ba47fde7cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/polars-stream/src/nodes/joins/asof_join.rs:483-488 | crates/polars-stream/src/nodes/joins/asof_join.rs:562-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/nodes/joins/asof_join.rs:483\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/asof_join.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb3be15974081aa573b88278fd5a6d1d832245c5fd84a6711bf34d3de7ee0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:904-908 | crates/polars-stream/src/physical_plan/to_graph.rs:946-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:904\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e9c401b977bc56a0c8708bf574940a3fd85f119740a09ad0d864e494601e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/polars-stream/src/physical_plan/to_graph.rs:915-919 | crates/polars-stream/src/physical_plan/to_graph.rs:935-939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/polars-stream/src/physical_plan/to_graph.rs:915\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4c90d26d27716cd02ad240571ba39e7642230c7e9add6352731b1c05e66dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): docs/source/src/rust/user-guide/transformations/joins.rs:217-223 | docs/source/src/rust/user-guide/transformations/joins.rs:231-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/source/src/rust/user-guide/transformations/joins.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/source/src/rust/user-guide/transformations/joins.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff2199cdc62b5983c50d8287fe4aefa2f414cc5a615f087e4c68b742251b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (202\u2013203 lines \u00D7 2): py-polars/src/polars/functions/eager.py:70-272 | py-polars/src/polars/functions/eager.py:387-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1308b19288a4f399f9d0ff71c8ad7b0b9d4cc4420437e4108316f39dd6a29ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (100\u2013141 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:7257-7397 | py-polars/src/polars/lazyframe/frame.py:5052-5151 \u2014 \u0060py-polars/src/polars/dataframe/frame.py\u0060 and \u0060py-polars/src/polars/lazyframe/frame.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 332 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":7257}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da1978ba86cf3a393c3b21adf1bd9ce460d828a7451560fe2bb5a7e84c033f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (82\u201385 lines \u00D7 2): py-polars/src/polars/functions/range/time_range.py:64-145 | py-polars/src/polars/functions/range/time_range.py:196-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. 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":"py-polars/src/polars/functions/range/time_range.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb47886e5af6bd2e8aac12f4e01d953c12e9e98d495de5bca51e6d4ffa0c118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58\u201376 lines \u00D7 2): py-polars/src/polars/functions/lazy.py:869-944 | py-polars/src/polars/functions/lazy.py:989-1046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44dd61eb87cdad6e90714aa2d7cc38d9b4bf48f9cc841869388d619eab648ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): py-polars/src/polars/functions/lazy.py:1426-1537 | py-polars/src/polars/functions/lazy.py:1640-1702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/functions/lazy.py:1426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/lazy.py"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"74320475bcb05bdb38d99bcf1b55c15eb9c2383645ce07eadc35ad7250b8b801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201353 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:519-567 | py-polars/src/polars/lazyframe/frame.py:500-552 \u2014 \u0060py-polars/src/polars/dataframe/frame.py\u0060 and \u0060py-polars/src/polars/lazyframe/frame.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 332 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"74556957796c5f02626e0402d1f653f0d5c3e94706ffb6d80b8a6edcb3042f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): py-polars/src/polars/dataframe/plotting.py:99-150 | py-polars/src/polars/dataframe/plotting.py:165-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 \u0060py-polars/src/polars/dataframe/plotting.py:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"py-polars/src/polars/dataframe/plotting.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5cc5fcb6b50c26788f2a4c211ad9b03470c4e93c6d1c6b4b60f703ab272a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201346 lines \u00D7 2): py-polars/src/polars/config.py:962-1002 | py-polars/src/polars/config.py:1006-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"py-polars/src/polars/config.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bad1d48a941e7bab309439345ad770f79ad9dca7a5023f8f34cae6c84704a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201342 lines \u00D7 4): py-polars/src/polars/expr/list.py:1542-1581 | py-polars/src/polars/expr/list.py:1584-1625 | py-polars/src/polars/expr/list.py:1628-1665 | py-polars/src/polars/expr/list.py:1668-1707 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"py-polars/src/polars/expr/list.py"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6eac5aa5911b726f642926e4625d619a005efee1af689a06ede11559a04185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:5100-5137 | py-polars/src/polars/lazyframe/frame.py:2967-3004 \u2014 \u0060py-polars/src/polars/dataframe/frame.py\u0060 and \u0060py-polars/src/polars/lazyframe/frame.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 332 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":5100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e67bf9ccccb7c18358c26938e1db5e49b71da79432a2a645c0adad12b0f0535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): py-polars/src/polars/testing/parametric/strategies/dtype.py:320-342 | py-polars/src/polars/testing/parametric/strategies/dtype.py:429-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/testing/parametric/strategies/dtype.py:320\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"py-polars/src/polars/testing/parametric/strategies/dtype.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed100b3e3f26bd65179ac8eae2dd851d77c1af43673c9655b004bd8fbaaae845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:5156-5178 | py-polars/src/polars/lazyframe/frame.py:3029-3051 \u2014 \u0060py-polars/src/polars/dataframe/frame.py\u0060 and \u0060py-polars/src/polars/lazyframe/frame.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 332 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":5156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7014bd6163f09049b0a5411d9bd5824cdede2a2cac5160626664986760308f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:1025-1045 | py-polars/src/polars/series/series.py:1501-1521 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cd8fffefe75595a4329cc21468b632f514652e29641cbd567d1930dc291ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): py-polars/src/polars/lazyframe/engine.py:507-525 | py-polars/src/polars/lazyframe/engine.py:606-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/lazyframe/engine.py:507\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"py-polars/src/polars/lazyframe/engine.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc7185fceb516c2355876dfb09dfaa8787eab961cfd6c89ca1876e1e43a844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): py-polars/src/polars/functions/eager.py:308-325 | py-polars/src/polars/functions/eager.py:619-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/functions/eager.py:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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: \u0060QueryOptFlags\u0060 names \u0060polars.lazyframe\u0060 in one and \u0060polars.lazyframe.opt_flags\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"729582ebaa242b5523a890d9803d1b7eeaaebd82260ef64757f6fe18600b0e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): py-polars/src/polars/lazyframe/engine.py:506-521 | py-polars/src/polars/lazyframe/engine.py:596-611 | py-polars/src/polars/lazyframe/frame.py:2676-2691 | py-polars/src/polars/lazyframe/frame.py:2695-2710 | py-polars/src/polars/lazyframe/frame.py:3797-3812 | py-polars/src/polars/lazyframe/frame.py:3824-3839 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/lazyframe/engine.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d48aeeef5ce58fd5ffe4410f4802e1366bf444efb9dade2c5d731ac7e3b4232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): py-polars/src/polars/functions/eager.py:355-370 | py-polars/src/polars/functions/eager.py:666-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/functions/eager.py:355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6ced1f03b799303efade4348ec32a46aaae05a8d9659adf30f9d18967a402d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): py-polars/src/polars/io/csv/functions.py:492-506 | py-polars/src/polars/lazyframe/frame.py:2698-2712 | py-polars/src/polars/lazyframe/frame.py:3807-3821 | py-polars/src/polars/lazyframe/frame.py:3835-3849 | py-polars/src/polars/lazyframe/frame.py:9690-9704 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/io/csv/functions.py:492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba4267abed10c018261a4522a31a64ae73e3942e8e74ff62f9580e433545a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): py-polars/src/polars/sql/context.py:1442-1456 | py-polars/src/polars/sql/context.py:1502-1516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/sql/context.py"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9228e53d71d1b9acdc1123959ce4139b5cd5e71309fc32f00ef27c25451151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): py-polars/src/polars/dataframe/group_by.py:212-220 | py-polars/src/polars/dataframe/group_by.py:968-979 | py-polars/src/polars/dataframe/group_by.py:1173-1182 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/dataframe/group_by.py:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/group_by.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f54b8a9cfacd65edb0cb6322f2c59e304552933f96b472cbad930c7d4187deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): py-polars/src/polars/_utils/various.py:99-110 | py-polars/src/polars/_utils/various.py:161-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. 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":"py-polars/src/polars/_utils/various.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20243bd09b70020bca530325e7e09c1ff0246a868267c2ba6eeeb5448debbe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:3046-3057 | py-polars/src/polars/dataframe/frame.py:3288-3299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: \u0060QueryOptFlags\u0060 names \u0060polars.lazyframe\u0060 in one and \u0060polars.lazyframe.opt_flags\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"959ef368c0b5cde8a33d20ad397f56bb96047bbae233ffc40b44477581c5175e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): py-polars/src/polars/io/csv/functions.py:522-531 | py-polars/src/polars/io/ipc/functions.py:192-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/io/ipc/functions.py:192\u0060 it begins part-way through the construct above it, so those exact 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":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d77e9cd355d60066d034ceedcb9768529e165a378df0927a2d2784d096275d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): py-polars/src/polars/functions/eager.py:275-283 | py-polars/src/polars/functions/eager.py:591-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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: \u0060QueryOptFlags\u0060 names \u0060polars.lazyframe\u0060 in one and \u0060polars.lazyframe.opt_flags\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"py-polars/src/polars/functions/eager.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e36719d3ef78eac2d208d96edc95dbc668abfdf3ed6ac555fce6cbee46b75d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): py-polars/src/polars/selectors.py:415-423 | py-polars/src/polars/selectors.py:424-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/selectors.py:415\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0dfadd4c7f61345eeb2e5604b3c904dc4b84af96f20d99af304b1e23ac5500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): py-polars/src/polars/sql/context.py:1875-1881 | py-polars/src/polars/sql/context.py:1919-1925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060py-polars/src/polars/sql/context.py:1875\u0060 it does not close everything it opens, so those exact 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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"de383d2315750e429b82ebc0e09253ac3153c76421834ef9e7e84d14b8b7d0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): py-polars/src/polars/series/series.py:1154-1159 | py-polars/src/polars/series/series.py:1212-1217 | py-polars/src/polars/series/series.py:1284-1289 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb4c2d9e00e58573620cee67bd97a2613151b1609b22ed5bb643af720299167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): py-polars/src/polars/selectors.py:237-242 | py-polars/src/polars/selectors.py:262-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c65c01461655e8c84e89fb594a39e364396cc5e7f00a634e35f75bcdbbcfca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (953 lines \u00D7 2): py-polars/src/polars/series/array.py:23-975 | py-polars/src/polars/series/list.py:28-1218 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"py-polars/src/polars/series/array.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"093c9ff7885fec47aa9f23561fb15e2abc0b2f021f5e319a0ce73fad44ee9055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:686-778 | py-polars/src/polars/series/series.py:449-501 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"4539afd719e7e111e69e352dd1088bed882e9ad74698c2717ecfc87a939cc990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:2855-2911 | py-polars/src/polars/expr/meta.py:449-495 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060py-polars/src/polars/expr/meta.py:449\u0060 it does not close everything it opens, so those exact 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca047d8bffe1082df1e73f9f702808db5603cbede1dde3dc8ef081b2e0c6f4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:7180-7249 | py-polars/src/polars/lazyframe/frame.py:7252-7328 \u2014 \u0060py-polars/src/polars/dataframe/frame.py\u0060 and \u0060py-polars/src/polars/lazyframe/frame.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 332 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":7180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a723e9c73ae53a51f1304270c9d260607d6a155585a47533f0f4d55d7d90533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): py-polars/src/polars/dataframe/frame.py:12454-12465 | py-polars/src/polars/series/series.py:8476-8488 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":12454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd394e2900ac07c01636897760f8aef77fb7d72a725f63b8d9c9fb257f22fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): py-polars/src/polars/expr/binary.py:179-225 | py-polars/src/polars/expr/string.py:1406-1445 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"py-polars/src/polars/expr/binary.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca857e0d95e2b6efe16d999a81fa89673d4d7e8d339abf8934720e0f04b67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): py-polars/src/polars/expr/binary.py:228-271 | py-polars/src/polars/expr/string.py:1448-1484 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"py-polars/src/polars/expr/binary.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeadbff4e13441967feb01099b7c32195b35e4c55bf7ae81c59a268b71fe7251"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project polars-python: polars-python has instability 0.87 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"99e27a2bd942ed39134e5af99200b844cd20353e96283b0007d1d9676405bbf7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project polars-sql: polars-sql has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"92f0a2567c7ef1a2a231959e5bdbebed1d5b5b772a5374da0fc708fa16ad661b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project polars-stream: polars-stream has instability 0.91 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9a08afba3486908091c968ac0809ffc370e443be04bd0972f5020f471c8dc88"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: polars-descriptions: polars-descriptions: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"123174c4277458931dee2cee0f2fc3300edc49511fe1be27f811ef938315a2db"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: polars-io-ext-ffi: polars-io-ext-ffi: 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":"05b7bef52139391c86c49d6111c7263eea0cbee94a6afd9b72106d9c2547d88d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: polars-buffer: polars-buffer: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3d34f9702e029d5d99451344efb15d1ecab7c79075d82c182b57c07bbe7867a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: polars-config: polars-config: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1be60ff0e5f2e38e380dd36e5c9f713b65ad10b74d77d3724dfd883991bc605b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChunkedArray (LCOM4 46): ChunkedArray\u0027s methods fall into 46 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 46 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"50278d2d940d5ef9b648cb10dac2d8cc453163278413fa7dc071ed2ecc882f5e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Series (LCOM4 36): Series\u0027s methods fall into 36 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 36 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7744b7bfbaacb7dbdadc827961714e7db5a4d159f4d40f4b518fe4d3da37f1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CsvReadOptions (LCOM4 23): CsvReadOptions\u0027s methods fall into 23 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 23 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/options.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4c5c42c1812e52cde5ef2367672888df551ac8b0230af7b855ae01cca5ff4a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DataFrame (LCOM4 9): DataFrame\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/dataframe.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea24d5b51fef18d22c63a7c171922d09ddb3421d31b2129b0ea704e991f353"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrowSchema (LCOM4 6): ArrowSchema\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io-ext-ffi/src/common.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daf2f19fb7adc2aa009de798ede20855ae1a22df04ef676941661f2b764cdc1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LazyFrame (LCOM4 5): LazyFrame\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a946a5c5e9b7ac97015086a1563d03c30cc4a3e45598e14036fd1a89e65192"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodeMetrics (LCOM4 5): NodeMetrics\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/metrics.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73fbb3d94f76097d7a5a32e0aac89d1957ca2488501e73c07d9d0a5c8251954"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PythonConvertRegistry (LCOM4 5): PythonConvertRegistry\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/python_convert_registry.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53660376898dfd1955c32641926cacba85144d6da90cecbaef563c261f20c3d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BinviewHashGrouper (LCOM4 4): BinviewHashGrouper\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/binview.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"18caa8ae46033d4c1e41c3990aa9502c4e74b95038643801ef38470f7d2d2815"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: KeyRowHashGrouper (LCOM4 4): KeyRowHashGrouper\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/key_rows.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a925ca4f312e04f0eaf2ea67f7fea2f1cab167972de0b5b6e22c0affdf7068"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RowEncodedHashGrouper (LCOM4 4): RowEncodedHashGrouper\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/row_encoded.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"05acafbb0ed537032fa9904a2a58eeba6c5a820d97ccc4948a78224b8ea23530"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SingleKeyHashGrouper (LCOM4 4): SingleKeyHashGrouper\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/groups/single_key.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f7d1a484f91bb4db510fd69515b9c3972b3f0f17ac6ba52830d6c7249a87f5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SketchUnionReducer (LCOM4 4): SketchUnionReducer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/approx_quantile.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f1b84c498a3d51376b4bb3e3ef6aaaa0454e2db306bbbf3a46db17cf18d6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NumUnorderedImplodeReducer (LCOM4 4): NumUnorderedImplodeReducer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/implode.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f3c987af432b8abd882e8de2f76da1ab7859a29eb0671eecd9d68b03f8d8c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NumMeanReducer (LCOM4 4): NumMeanReducer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mean.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fbdc416be5196b41880945bc97474b24045ce8305138fd62cef8d5118f0c05"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BoolVarStdReducer (LCOM4 4): BoolVarStdReducer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/var_std.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f78f105e4e339cbcc9329009ec30c0f84db7982548354a1f96fa3d9b41f7f7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BinViewDecoder (LCOM4 4): BinViewDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d54233e81d65453abc45ca3f0068d7a58313d34092a6ac4229be6aa544f7ca"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CategoricalDecoder (LCOM4 4): CategoricalDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/categorical.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4a7b7938ef4ee7b7354208414f8f40d2dbd830d02dd7fc4c1beda29c8c6d12"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BinaryDecoder (LCOM4 4): BinaryDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b79a7fd034dcd607ef03fafe8244f87537f21f2126297a39c81b2cf774639ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FixedLenDecimalDecoder (LCOM4 4): FixedLenDecimalDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dc15cbb5e6f7a04575c6f210acc6bd0fb34bca23a4867264774f5cb25af538"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FloatDecoder (LCOM4 4): FloatDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/float.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f32c8b6dd5bd35d5cdd0e3fda145ae64f0f7ac90144152d84d8e914c58c34e8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IntDecoder (LCOM4 4): IntDecoder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/primitive/integer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b97811dd9e4d7246da3bfd1db73f66f15fe6ebfb8813c6684146a344af1fb2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JoinTuning (LCOM4 4): JoinTuning\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/tuning.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bb9a6afef735fa009d41ca7f794b01ee225912fc223c6a3f768fb12996305e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 424 in polars_plan::plans::conversion::dsl_to_ir::functions::convert_functions at line 16. 6 of those changes were fix/bug commits, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a62e6061baae6a55856a6d09e54da6e3ed55b5751d89d4fb0abd240ec0ebdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-python/src/lazyframe/visitor/expr_nodes.rs: crates/polars-python/src/lazyframe/visitor/expr_nodes.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 421 in polars_python::lazyframe::visitor::expr_nodes::into_py at line 860. 5 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-python/src/lazyframe/visitor/expr_nodes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"241924b54a8af7e934fdfa1770cfabf48c2e18eda849232096f50680d6b3e3ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/functions.rs: crates/polars-sql/src/functions.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 236 in SQLFunctionVisitor::visit_function at line 1442. 17 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e388509ad1a57e3847d0df7940510f7fd2149f196a80585a43ea4d8b80e6418"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/ir_to_dsl.rs: crates/polars-plan/src/plans/conversion/ir_to_dsl.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 369 in polars_plan::plans::conversion::ir_to_dsl::ir_function_to_dsl at line 340. 3 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/ir_to_dsl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/ir_to_dsl.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0056c2ca2326a40365ace1678c8882cc07e074db99c2b600e30b2123750bff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/lower_ir.rs: crates/polars-stream/src/physical_plan/lower_ir.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in polars_stream::physical_plan::lower_ir::lower_ir_inner at line 279. 1 of those changes was a fix/bug commit, and the other 43 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/lower_ir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"87baae71dff6ead4342371d801e0a5251b3c6586cd8f6117d271e5dd306b8eaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/context.rs: crates/polars-sql/src/context.rs changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in SQLContext::execute_select_block at line 3575. 39 of those changes were fix/bug commits, and the other 61 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a3054dd2a93ac1e6ad395dc4ae1704837ce1cfed322177631b3f8cc5d4a57e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/function_expr/schema.rs: crates/polars-plan/src/plans/aexpr/function_expr/schema.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 197 in IRFunctionExpr::get_field at line 9. 13 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/function_expr/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/schema.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2526543a94ab80b0e04b5813f543ff94fe1507651fd879b40a2965288e11037"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs: crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 266 in ProjectionPushdownVisitor::pushdown at line 235. 8 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb132cf8c692aa538d3ef90381b25324f343a649c2fed5c80392acb9cca46da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/lower_expr.rs: crates/polars-stream/src/physical_plan/lower_expr.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in polars_stream::physical_plan::lower_expr::lower_exprs_with_ctx at line 556. 6 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/lower_expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8cf3c1fe80f3897511eb9b0783f8bdf07096ba9c19ce75ae1c6daea5dd1415"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in polars_plan::plans::conversion::dsl_to_ir::to_alp_impl at line 194. 5 of those changes were fix/bug commits, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"25799e0e7fc27cfc17d79c2b884044008f4fbc97ba75ab35bd4c8326b8b208e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/sql_expr.rs: crates/polars-sql/src/sql_expr.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in SQLExprVisitor::visit_binary_op at line 1123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/sql_expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd19f7100816b63d7ee0b02d82ea096cdc431d250fa890c7f76cd3a0a1cc27b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/to_graph.rs: crates/polars-stream/src/physical_plan/to_graph.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in polars_stream::physical_plan::to_graph::to_graph_rec at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/to_graph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca017d76267ac49842cb88cd29b775f408b83e808d1eed009252b2036267a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/fmt.rs: crates/polars-stream/src/physical_plan/fmt.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 127 in polars_stream::physical_plan::fmt::visualize_plan_rec at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/fmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee15d1df6f5e644ce7210e57cf7056084e1288f3352fa7219ad2476138a152b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/dispatch/mod.rs: crates/polars-expr/src/dispatch/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in polars_expr::dispatch::function_expr_to_udf at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/dispatch/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3204ff64d79479e9c689f8aaf111d094be08c672b412383d10e2d9529eb3a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/function_expr/mod.rs: crates/polars-plan/src/plans/aexpr/function_expr/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in IRFunctionExpr::fmt_name at line 877. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/function_expr/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e86076f3dc863089952b12318e2c9796b90525bf1a60173ed5e4ecf8abb33a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/type_coercion/mod.rs: crates/polars-plan/src/plans/conversion/type_coercion/mod.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in TypeCoercionRule::optimize_expr at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/type_coercion/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2d0a455a60bbd884c0de06c3637bf29972ceff8404eb8b308e1f2b9f0d5947"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-compute/src/cast/mod.rs: crates/polars-compute/src/cast/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 317 in polars_compute::cast::cast at line 400. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-compute/src/cast/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bac33ab7ee00862166b47f9911029e6ecf73dbd55c9cc262666a74253f8d93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/subquery.rs: crates/polars-sql/src/subquery.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SQLContext::try_attach_join_membership at line 1253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/subquery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/subquery.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"26242d6ff380167c064ccaad19cfbd6c6f3aca1b0e1a5dcf2c70ab07e41ff18c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/dsl/function_expr/mod.rs: crates/polars-plan/src/dsl/function_expr/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in FunctionExpr::fmt at line 856. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/dsl/function_expr/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/mod.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"08769039d9af5c8e35bde003fcdf25a2296fe3c0552ccf632bd278b25472843a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/to_description.rs: crates/polars-stream/src/physical_plan/to_description.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in polars_stream::physical_plan::to_description::phys_props at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/to_description.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_description.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c61ea066f0811ec9873cdf80332c69778ba45cafe0077ccc66be134cdb19b83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/utils/supertype.rs: crates/polars-core/src/utils/supertype.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 179 in polars_core::utils::supertype::get_supertype_with_options at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/utils/supertype.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb70d5120cea90c41b808d9b3832449e44fc9fdf82fbe8eaf8480c34e3858d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/schema.rs: crates/polars-plan/src/plans/aexpr/schema.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in AExpr::to_field_impl_inner at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc3afa7388fc0c49d8cbc6dfde8e804fa20b8b4c6bd9be4e5c2cb2c1fcec0f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/mod.rs: crates/polars-stream/src/physical_plan/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in polars_stream::physical_plan::_visit_nodes_impl at line 662. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"83feb80dfef059db71202ece431cecf7a0011a56a5edbb68f96de71a12bda4f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs: crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in SimplifyIRNodeOrder::simplify_ir_node_orders at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd5215007b257e591cdfa54fa09c0c3c88436936f1b4ee8e3826c01cac5dce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/iceberg/_dataset.py: py-polars/src/polars/io/iceberg/_dataset.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in IcebergScanResolver._to_dataset_scan_impl at line 410. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/iceberg/_dataset.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":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd856c9a64f7bad0a08728883d766589506242e5fecbc3973b2d486784f447d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/format.rs: crates/polars-plan/src/plans/ir/format.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in ExprIRDisplay::fmt at line 478. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/format.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a68a9cf13eeabb3b78fbf1f0c40cb528931337a1423056460d30e025f827337"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/mod.rs: crates/polars-plan/src/plans/optimizer/mod.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in polars_plan::plans::optimizer::optimize at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc9cb19c05b778686deb376fa68b10a7e8f47318c3116c580c8eab3b167e0a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/lazyframe/frame.py: py-polars/src/polars/lazyframe/frame.py changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LazyFrame.describe at line 1060. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/lazyframe/frame.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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f6e8cc8480a3f70877e428a68dbfab6c9bbda2499bff21d3827a644a8841dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/physical_plan/lower_group_by.rs: crates/polars-stream/src/physical_plan/lower_group_by.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in polars_stream::physical_plan::lower_group_by::try_lower_elementwise_scalar_agg_expr at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/physical_plan/lower_group_by.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f645e80d532c4a16ced5bc40e4c6cbdc07b2455ffb6d72f685e522d7f10b936c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs: crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in ExprOrderSimplifier::rec at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_ordering/expr.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c184533caca193443840c01f0ffa0eb56abd9e1c92bfeefdd7ffbab8d36801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs: crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in PredicatePushDown::push_down at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"deff082747d26aba180086514c60b9da4744e3850bc2c28b9428f5ffe5a10d25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs: crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in SimplifyExprRule::optimize_expr at line 763. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d210200f5172bf6e856e4a7d113da2e7e41696f192d7905af5b7024518696d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs: crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in polars_plan::plans::optimizer::predicate_pushdown::join::predicate_pruning::try_rewrite_join_type at line 624. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/predicate_pruning.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43d3b0cad201b52c0331b1c5c50891c9b1b23fd6a192e594dffb1947c8b748a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/stats/node.rs: crates/polars-plan/src/plans/stats/node.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in polars_plan::plans::stats::node::node_stats_with_cache at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/stats/node.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1d784cbe06151ed311a68e7c6f4597d4c945c0a4d33062428bacfabeebe52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/dataframe/frame.py: py-polars/src/polars/dataframe/frame.py changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in DataFrame.__init__ at line 379. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/dataframe/frame.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2276442f07a0bfa708192ef725fdda7f1c284f49f1258c35d494f839114eeeef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/sql/context.py: py-polars/src/polars/sql/context.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in context._alter_catalog_table at line 2172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/sql/context.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":"py-polars/src/polars/sql/context.py"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ceb9f0e8c8e80e8cf7b8675ffdcd18d0f3b9606745c22832031fd2b7f1293"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/dsl/file_scan/mod.rs: crates/polars-plan/src/dsl/file_scan/mod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in CastColumnsPolicy::should_cast_column at line 1050. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/dsl/file_scan/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4b1b42719a77dea1114a6bfe7c42c470040d6f4448779fd32b0eff6e61cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/sortedness.rs: crates/polars-plan/src/plans/optimizer/sortedness.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in polars_plan::plans::optimizer::sortedness::is_sorted_rec at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/sortedness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/sortedness.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba3dc8c4e46a646c5b493537fffbaa429a2e24da8c7d5d3ada6c7602ef9fdbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in polars_plan::plans::conversion::dsl_to_ir::scans::csv_file_info at line 1268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf3d212285ad847ec814e11a6c92893157d9cfdd8d418ed508f784c68518397"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in polars_plan::plans::conversion::dsl_to_ir::expr_to_ir::to_aexpr_impl_inner at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_to_ir.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f46d62b9da445ff49fb123f4da93e7917dc5caba4088530b149a2a9a588eb56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in polars_plan::plans::conversion::dsl_to_ir::join::resolve_join at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/join.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"39af8760c3d4689e5bee3e8d88f2ccfafc703e804a46bde90d7937adadd43d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-python/src/lazyframe/visitor/nodes.rs: crates/polars-python/src/lazyframe/visitor/nodes.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in polars_python::lazyframe::visitor::nodes::into_py at line 538. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-python/src/lazyframe/visitor/nodes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"356eb51d173319cd12443ea8f2d493fc8ff3846727dba883b87d2776ddb467f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/datatypes/any_value.rs: crates/polars-core/src/datatypes/any_value.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in AnyValue::strict_cast at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/datatypes/any_value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/any_value.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96ba19f176e704425a777b7316e0d5cf9901498d7761fd997c96ac1009f919f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs: crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in polars_plan::plans::optimizer::predicate_pushdown::join::process_join at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/join/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"483ea9d2df4f28f7849aa4017e62fc3cfb208d471613e7c041de5b48d05ee972"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ReaderStarter::run at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c563bdda418cd99990d96367754c60f89b6a381436ade062369f8bf3bf1cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs: crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in polars_plan::plans::aexpr::predicates::skip_batches::aexpr_to_skip_batch_predicate_rec at line 336. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/skip_batches.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8dd5e918895658c89659fb47202b3440cbd24585d5cecc6f428c94143fb057"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/joins/semi_anti_join.rs: crates/polars-stream/src/nodes/joins/semi_anti_join.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in SemiAntiJoinNode::update_state at line 1117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/joins/semi_anti_join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/semi_anti_join.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb34d102c15e60a89b40fb5c2d423b6abcb98d0157a8fc8ad8edf6bd614f76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/parquet/init.rs: crates/polars-stream/src/nodes/io_sources/parquet/init.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ParquetReadImpl::init_morsel_distributor at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/parquet/init.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/init.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09af97a20389d083d2370fcc6afcf057a203889e9b783ce25b6ccf1b1d4c780"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/cse/cache_states.rs: crates/polars-plan/src/plans/optimizer/cse/cache_states.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in polars_plan::plans::optimizer::cse::cache_states::set_cache_states at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/cse/cache_states.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/cache_states.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"67045c7bd3caa529ef0fb83a9c41942012a816f0e2f8d0ebd3f56272f60521c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/series/series.py: py-polars/src/polars/series/series.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Series._arithmetic at line 1041. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/series/series.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":"py-polars/src/polars/series/series.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc37646e0da044a7cc821b5b9f32d6262dabc58adc1e83015910007a4068789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs: crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in polars_plan::plans::conversion::dsl_to_ir::expr_expansion::expand_expression_rec_inner at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/expr_expansion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4797c97acd60340b0d91232f066d8d5decac62b592e430b0304976d30c51a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/iceberg/_sink.py: py-polars/src/polars/io/iceberg/_sink.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in IcebergSinkState.new at line 1240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/iceberg/_sink.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":"py-polars/src/polars/io/iceberg/_sink.py"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0a0f4a8d2e47da386dde4fbe91624d054f29aa40abcf6a3aa9f5592c27612a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/dsl/format.rs: crates/polars-plan/src/dsl/format.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Expr::fmt at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/dsl/format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/format.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ea391942828070ad1cd0449819f63516534347761bfcfd56471c814f16a895"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-mem-engine/src/planner/lp.rs: crates/polars-mem-engine/src/planner/lp.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in polars_mem_engine::planner::lp::create_physical_plan_impl at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-mem-engine/src/planner/lp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb41fac670357b9a56fe39d49b71c4206d2acc448ad6d43755664c482eb35d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/series/from.rs: crates/polars-core/src/series/from.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Series::_try_from_arrow_unchecked_with_md at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/series/from.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"909d5dfc25db39018aea7b3d5ae6776d4ba9631a4c65164a39e5b70d06c25e1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs: crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in SlicePushDown::pushdown at line 225. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d3c5f988cab4af488c75c3a072565807e28d879735d059bf7e8f393f14bdb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-ops/src/frame/join/mod.rs: crates/polars-ops/src/frame/join/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in DataFrameJoinOps::_join_impl at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/frame/join/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1511f4852ca16359dd00accdf512285e125620d1975f6e502f2f9339521f2a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/python/pyarrow.rs: crates/polars-plan/src/plans/python/pyarrow.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in polars_plan::plans::python::pyarrow::to_pa at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/python/pyarrow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ced8cfdb002c19b029d53942e224fe76f9b0e0c0d6314446024b3af2a0d0980"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/to_description.rs: crates/polars-plan/src/plans/to_description.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in polars_plan::plans::to_description::ir_props at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/to_description.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/to_description.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6ac063c1f517da8da8fc69d59749adaee15267785c19c82138e0c22e3e51d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/equality.rs: crates/polars-plan/src/plans/ir/equality.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in IR::is_ir_equal_shallow at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/equality.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/equality.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1f45510ee4023da776545bf002739b73fe41034b4b2f2206ad6d8adfe57d9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/csv/functions.py: py-polars/src/polars/io/csv/functions.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in functions.read_csv at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/csv/functions.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":"py-polars/src/polars/io/csv/functions.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98bf09b73e1b772b3689713521e51b4323ea20c34323fd81cabe5199127f01a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/ipc/mod.rs: crates/polars-stream/src/nodes/io_sources/ipc/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in IpcFileReader::begin_read at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/ipc/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64961221494dd1ad95a8f1a9c4d75de1795fb20282c2a63d3373847e0424926"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs: crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in polars_plan::plans::aexpr::predicates::column_expr::specialize at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c1c8f3da723e4c6085207a5f27db6fd2bd40400f8fa84ce799dc93abfa5312"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-io/src/csv/write/write_impl/serializer.rs: crates/polars-io/src/csv/write/write_impl/serializer.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in polars_io::csv::write::write_impl::serializer::serializer_for at line 666. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-io/src/csv/write/write_impl/serializer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/write/write_impl/serializer.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae150c8158d69249ca297195583de54591a86854b99f3a2a5b8237bdbb453f0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/planner.rs: crates/polars-expr/src/planner.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in polars_expr::planner::create_physical_expr_inner at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/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":"crates/polars-expr/src/planner.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"90936a4553d35fda4fe0cc8e724e426098ad8bd09057be9cf3b9d68b82ee60d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/reduce/convert.rs: crates/polars-expr/src/reduce/convert.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in polars_expr::reduce::convert::into_reduction at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/reduce/convert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/convert.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d2ce4e856dda39e3b71cf7e47a54665d8231cd63144d25012caa012b1c565"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs: crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RowGroupDecoder::row_group_data_to_df_prefiltered at line 682. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a12840d998521bc68313cfcbf6059f2ad28ab47262565cd60b45617c41dd00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/datatypes/dtype.rs: crates/polars-core/src/datatypes/dtype.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in DataType::try_to_arrow at line 1316. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/datatypes/dtype.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c0abe3f4f66f868b1bc96aa5cf135482aa4e6a741aa49a1b4780108631b706"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/expand_datasets.rs: crates/polars-plan/src/plans/optimizer/expand_datasets.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in polars_plan::plans::optimizer::expand_datasets::rebuild_scan_from_expanded at line 649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/expand_datasets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35cb769602a1193036a32dba3dcddbc1db0d8567bfb8c9faf7eb82ac1d236b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-mem-engine/src/scan_predicate/functions.rs: crates/polars-mem-engine/src/scan_predicate/functions.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in polars_mem_engine::scan_predicate::functions::create_scan_predicate at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-mem-engine/src/scan_predicate/functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"938faaa7d1d92e38634536a88cee25a8a4eaf16871820e9f02702df83ffaa1bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/mod.rs: crates/polars-plan/src/plans/aexpr/mod.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AExpr::is_fallible_top_level at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"32853ed83375ab21ce8b6c95ce512159ffd6fff77470064765bd99403814d5ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/type_coercion/binary.rs: crates/polars-plan/src/plans/conversion/type_coercion/binary.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in polars_plan::plans::conversion::type_coercion::binary::coerce_comparison_literal at line 543. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/type_coercion/binary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49f8a6f012652a3bee981b391be8d766198634b8c3d678066e8805d9e395ebb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/frame/mod.rs: crates/polars-core/src/frame/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DataFrame::sort_impl at line 1443. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/frame/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/mod.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb533653a714ba28af9b68cd3851df558ed6f54eb5fa97dab49161a9211b09e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/dot.rs: crates/polars-plan/src/plans/ir/dot.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in IRDotDisplay::_format at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/dot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/dot.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"55084e525ff8fcacfdb0816e5fe5b54bebc0fbd778c8a113314f05a3b4d879ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in polars_stream::nodes::io_sources::multi_scan::pipeline::initialization::finish_initialize_multi_scan_pipeline at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc304f3c76b3054453de250c743feb3b20ca6cf183cec920b6eb57f03925313c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs: crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in polars_plan::plans::optimizer::predicate_pushdown::utils::pushdown_eligibility at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d2dd87249d17796cc7467d2395c83b93b09ab285234cc16c7a841b442328c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-python/src/sql.rs: crates/polars-python/src/sql.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PySQLContext::catalog_statement at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-python/src/sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/sql.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"954d99504e4246022ace08e44d32b72fe454658438b01a02ae44f07215841af6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs: crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in NDJsonFileReader::begin_read at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd119264e52171a7a090033615c7f8c93fb66b87f068139f8324805a458a768"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/_utils/construction/series.py: py-polars/src/polars/_utils/construction/series.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in series.sequence_to_pyseries at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/_utils/construction/series.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":"py-polars/src/polars/_utils/construction/series.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a6a51330ea1a589b516cadc31249aef6e48e1db046a903515903654e88fac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs: crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in polars_plan::plans::optimizer::join_runtime_filter::process_join at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_runtime_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404685ed2a5f8d7036ff0a09382d14bbb853b8145fd80412f7d67612f94408a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/catalog.rs: crates/polars-sql/src/catalog.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in polars_sql::catalog::partition_field at line 971. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde2c60eee2c896c933f97dcceeac88a7ab32e03ce0a4537e5b44203a07aadce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-io/src/predicates.rs: crates/polars-io/src/predicates.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ColumnPredicateExpr::new at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-io/src/predicates.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa4b540ebf77b30aa176885642add4047ba3eefdff2d2e4b2a0dd223e4ec8c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/_utils/udfs.py: py-polars/src/polars/_utils/udfs.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in InstructionTranslator._expr at line 740. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/_utils/udfs.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":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea8c1f40e983b132eda2f85c1e5ba99fc947b45b550dc54d92ec79f69e8c874"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs: crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in polars_parquet::arrow::read::deserialize::binview::decode_plain_generic at line 383. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/binview/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf776598f4338679aad1c5a79a945be0a2d0d779a0df62d92af9daa74f75f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/delta/_dataset.py: py-polars/src/polars/io/delta/_dataset.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in DeltaDataset.to_dataset_scan at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/delta/_dataset.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":"py-polars/src/polars/io/delta/_dataset.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f2e6750acb9aced258a5c95e3bc1875d330aea2e7b100e8ef335df5658799"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/tree_format.rs: crates/polars-plan/src/plans/ir/tree_format.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in TreeFmtNode::node_data at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/tree_format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"693659a974343b4c6d2bd52c0fcc77e3029b386569f12b1464ef8015912c67fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/hash.rs: crates/polars-plan/src/plans/ir/hash.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in IR::hash_excluding_inputs at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/hash.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/hash.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97810b0d843b0c00419eab94e1c72481863287401186ec09e1aa7d6950691c32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/properties/general.rs: crates/polars-plan/src/plans/aexpr/properties/general.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in polars_plan::plans::aexpr::properties::general::can_pre_agg at line 450. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/properties/general.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/properties/general.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"626e5bc891f82306f88b81da6fb56b417ea241e1a680f30e8cffbc695774c545"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/function_expr/list.rs: crates/polars-plan/src/plans/aexpr/function_expr/list.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in IRListFunction::get_field at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/function_expr/list.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd11527f53868eca1375df1f0bc10c84d6794ca10b34b612782a2501d59933a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/ternary.rs: crates/polars-expr/src/expressions/ternary.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TernaryExpr::evaluate_impl at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/ternary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/ternary.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0dafcbec00bffe1c544aaf2663c9af004de11cb7d936e6c350e0076da3fc53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/join_order/cluster.rs: crates/polars-plan/src/plans/optimizer/join_order/cluster.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in polars_plan::plans::optimizer::join_order::cluster::extract at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/join_order/cluster.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_order/cluster.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad9408d95b85de4f6d79cad52c68ec1ca1ba021749c60e1d810ed144b742f86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/aggregation.rs: crates/polars-expr/src/expressions/aggregation.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in AggregationExpr::evaluate_impl at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/aggregation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b877bfd6d6bdaa489785a07f2509db55f0c470702b45ac8be9403611960c86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DeletionFilesProvider::spawn_row_deletions_init at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"71912acddc4c626e67e6688763bdc6b9bcc89d6b88b8dacdd71e9ab0f36ff7b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/window.rs: crates/polars-expr/src/expressions/window.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WindowExpr::evaluate_impl at line 450. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/window.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada0900167f5a177f239da5830c3fcd357dc14aaf5b2b34f76c7923cdfa6e96a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-python/src/conversion/any_value.rs: crates/polars-python/src/conversion/any_value.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in polars_python::conversion::any_value::py_object_to_any_value at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-python/src/conversion/any_value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/any_value.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d336abf063ab1141d2cfeb0034015083b2ab1a8cec1a5e807678f741cf48aea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/extract_window.rs: crates/polars-plan/src/plans/optimizer/extract_window.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in polars_plan::plans::optimizer::extract_window::extract_from_projection at line 527. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/extract_window.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/extract_window.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ccc13dbe9703309cd000ff3690d63f547bf3699a5e45e02598bde07849757b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/csv/mod.rs: crates/polars-stream/src/nodes/io_sources/csv/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CsvFileReader::begin_read at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/csv/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed8083ef929bbbfc83df469726a29d24823b23cfe10221cf363bbfc1b3975cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in ColumnSelectorBuilder::attach_transforms at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea75b67168076c423f7cf18e84b25fd71d17d25e1d95adec0c518831ae78de4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/apply.rs: crates/polars-expr/src/expressions/apply.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ApplyExpr::evaluate_on_groups_impl at line 528. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/apply.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe98ee37febe02462637fa50f68536462c828c59160d659d5a292a5baf729da0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/types.rs: crates/polars-sql/src/types.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in polars_sql::types::map_sql_dtype_to_polars at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/types.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e38db65baf403c1b98a8df9444c991e2a0d9f5889831f8e90b3a61d80055a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/group_by/sink.rs: crates/polars-stream/src/nodes/group_by/sink.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SinkState::spawn at line 501. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/group_by/sink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/sink.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"497fb9268b93090cff3e27a613fe537ebbeb4e31a1e4045756e4b53f327e922a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-io/src/csv/read/parser.rs: crates/polars-io/src/csv/read/parser.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in polars_io::csv::read::parser::parse_lines at line 1134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-io/src/csv/read/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c6b644641f26e4f20ccb75feb5a22a92e3105b6eb06a96fc69603fa8daf8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-sql/src/table_functions.rs: crates/polars-sql/src/table_functions.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PolarsTableFunctions::read_csv at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/table_functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/table_functions.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59d6f2bb8fb9f92b7ac74c4fbe94d2b69c70edf30ca5ef5206f12440f9cb8f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs: crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PipelineBudget::acquire at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42648fc6d289b64c260d35befe82a1fd890c898744b24e973675fe882ac8302"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs: crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in polars_plan::plans::optimizer::simplify_expr::simplify_functions::optimize_functions at line 3. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"519ddf52a201d32511e810b44af9aeb01632379fb6a5f9e25a33433523d65ddb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-time/src/windows/group_by.rs: crates/polars-time/src/windows/group_by.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GroupByDynamicWindower::insert at line 1093. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-time/src/windows/group_by.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/group_by.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede5036efcdc2b6806e75fffba672d9b3339dd313b9f3cc6ff8a1a8f1cddeec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/filter_constraint.rs: crates/polars-plan/src/plans/aexpr/filter_constraint.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in polars_plan::plans::aexpr::filter_constraint::model_and_chain at line 543. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/filter_constraint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/filter_constraint.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c15fa8b20b6e09035234577b93a7aef7ed1b5d26f755e4e4c3be3366046204f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/spreadsheet/functions.py: py-polars/src/polars/io/spreadsheet/functions.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in functions._read_spreadsheet_calamine at line 1031. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/spreadsheet/functions.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":"py-polars/src/polars/io/spreadsheet/functions.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4780c673fc640eeee2b7c6541c5a82163aba42bbb8704492adf21570af2384b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/frame/group_by/aggregations/mod.rs: crates/polars-core/src/frame/group_by/aggregations/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ChunkedArray::agg_arg_max at line 758. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/frame/group_by/aggregations/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2901635862ac22dc66ae82fb8756631fb47b0627bb40a6aa1472143e2c196c71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/joins/equi_join/mod.rs: crates/polars-stream/src/nodes/joins/equi_join/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in EquiJoinNode::update_state at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/joins/equi_join/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6d5e8d485e15d5856478373a78095592cba44b8db3694e02e7007dc5661ee9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/binary.rs: crates/polars-expr/src/expressions/binary.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in BinaryExpr::evaluate_on_groups_impl at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/binary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/binary.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14acf3a8cd20378c218d783554e1ef1e025c42a9f43ee4940e7c6667e97b2d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/database/_executor.py: py-polars/src/polars/io/database/_executor.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConnectionExecutor.execute at line 561. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/database/_executor.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":"py-polars/src/polars/io/database/_executor.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd045c33b4654fceaf8714eab9b524538de2f9a71d647a1c6dacb17e7b89d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs: crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in polars_plan::plans::optimizer::simplify_expr::arity::simplify_binary at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6a7c2462175d72b00bf8130e798c4411c53fc26e01dbffc65d5c813e628a01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-parquet/src/arrow/write/dictionary.rs: crates/polars-parquet/src/arrow/write/dictionary.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in polars_parquet::arrow::write::dictionary::array_to_pages at line 497. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/arrow/write/dictionary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/dictionary.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"03642b2a7cfe3f6066af98881a062235bc6ff9bad72910384d420fdb2be76afe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs: crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in polars_plan::plans::optimizer::slice_pushdown_expr::aexpr_slice_pushdown_top at line 351. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_expr.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5667fb10deef0b7a9eb7bea42273a5f92b341205ad0bf0c53a4e373da09657a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/ir/inputs.rs: crates/polars-plan/src/plans/ir/inputs.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in IR::exprs_mut at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/ir/inputs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/ir/inputs.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7840103e2c2b02ac139e5c947711a0a49a39c81db3229c5efc978b0558723641"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/sort/mod.rs: crates/polars-stream/src/nodes/sort/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SortNode::partition at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/sort/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"91860e838b1b84ec21d8d1a9672bf6e82beb5877a3810f3ac0edc8b031eb2580"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-ops/src/frame/join/merge_join.rs: crates/polars-ops/src/frame/join/merge_join.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in polars_ops::frame::join::merge_join::gather_and_postprocess at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/frame/join/merge_join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/merge_join.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"269e1f7b32ee6c77dd14210c2ec291164019a98170c74b5d9187abfdabc289f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-time/src/group_by/dynamic.rs: crates/polars-time/src/group_by/dynamic.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Wrap::impl_group_by_dynamic at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-time/src/group_by/dynamic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/group_by/dynamic.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16c9d7f434ffb221a691f90cbf3d91fc305f21804d6fd16da53b9049403c34a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/projection_height.rs: crates/polars-plan/src/plans/aexpr/projection_height.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in polars_plan::plans::aexpr::projection_height::aexpr_projection_height at line 303. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/projection_height.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/projection_height.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb81b270e31f782b16b0b7f0424041a9d61e2d8fe17ea8c3e0ce01b5f5e53fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-parquet/src/arrow/read/statistics.rs: crates/polars-parquet/src/arrow/read/statistics.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in polars_parquet::arrow::read::statistics::deserialize_all at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/arrow/read/statistics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/statistics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9469b66c8bbac3a02386e7c9a10285d7dba80cb2278fe5ae3e0361bf39167771"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-io/src/cloud/concurrency/mod.rs: crates/polars-io/src/cloud/concurrency/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ConcurrencyController::spawn_control_loop at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-io/src/cloud/concurrency/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8141ad4c472e2209e449db349a1ca2be76dc850332dc85524d438ff3b55df057"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/functions/lit.py: py-polars/src/polars/functions/lit.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in lit.lit at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/functions/lit.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":"py-polars/src/polars/functions/lit.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d007fb24950496da222517481dc280f732a6dbc528c115f10db720d09e173c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/merge_sorted.rs: crates/polars-stream/src/nodes/merge_sorted.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in MergeSortedNode::spawn at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/merge_sorted.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/merge_sorted.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa5d02b1e876a0533a408c27c78c5fef43fcac5a404f42fbb2d0b0bd1f3422"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-ops/src/chunked_array/strings/namespace.rs: crates/polars-ops/src/chunked_array/strings/namespace.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MatchesToEnd::parse at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/chunked_array/strings/namespace.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7edbf3873454f9f1f5726ee160e5b39da2d992a1c3f059369d619835d09a42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs: crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PageDecoder::collect_predicate_flat at line 591. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/mod.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c16b8f368023e764ba8e80f5fc900646aff8c0d24fa54fd70038ec8ed9c429f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-ops/src/frame/join/cross_join.rs: crates/polars-ops/src/frame/join/cross_join.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in polars_ops::frame::join::cross_join::fused_cross_filter at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/frame/join/cross_join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/cross_join.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb406f1a6bce914a4d1ffdde68f7b4685c88cba66c8d91b6e6413160d09d2e78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs: crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RecordBatchDataFetcher::run at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8d66417ad3c77f0f999d6b81a13fa3d75301e0fcd5d88d6542eda6658fdf9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-compute/src/rolling/mod.rs: crates/polars-compute/src/rolling/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in polars_compute::rolling::create_validity at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-compute/src/rolling/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"545de59a21ebebb2052cffb86759d1c1ddf457b68180a0f4c7ca56c96fecbcc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/series/arrow_export/mod.rs: crates/polars-core/src/series/arrow_export/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ToArrowConverter::array_to_arrow_impl at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/series/arrow_export/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arrow_export/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c480e3ae028f1a14aaf47f4fdcb2bd62995e44cf22625e8c8378d8ec530047aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/join_pushthrough.rs: crates/polars-plan/src/plans/optimizer/join_pushthrough.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in polars_plan::plans::optimizer::join_pushthrough::candidate at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/join_pushthrough.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/join_pushthrough.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3d1faca2b822489c9e374b761034be7a931ecefdf5e7445f72a3d4a25441f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs: crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in polars_plan::plans::optimizer::call_dsl_resolvers::call_dsl_resolvers at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/call_dsl_resolvers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"832859fe2bd3118bd2a7020b02b309f82a1246ff0081886266a5791428d61f6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/execute.rs: crates/polars-stream/src/execute.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in polars_stream::execute::execute_graph at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/execute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3f2c09df92652302336844fc481985f37fb4a1da4741d96626fa2e1033e6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-json/src/json/deserialize.rs: crates/polars-json/src/json/deserialize.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in polars_json::json::deserialize::_deserialize at line 413. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-json/src/json/deserialize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-json/src/json/deserialize.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fed7e85e663d431366d2b84fd84773a33c358642ff915aecdc6226d2ec8355"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-row/src/decode.rs: crates/polars-row/src/decode.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in polars_row::decode::dtype_and_data_to_encoded_item_len at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-row/src/decode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/decode.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"628015d19d659c212a8536433638e3d9e000e815de75dc0adacf5b458f0578fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/conversion/stack_opt.rs: crates/polars-plan/src/plans/conversion/stack_opt.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ConversionOptimizer::optimize_exprs at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/conversion/stack_opt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b63a1a7c8fe7c210e39006d16fb74282b6048fda5f9deab856257e645d73d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-io/src/csv/read/streaming.rs: crates/polars-io/src/csv/read/streaming.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in polars_io::csv::read::streaming::infer_schema at line 771. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-io/src/csv/read/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d8c2b289a519c27cabdb40d20535919870e70f0eecf45fcd799d0a2025d3ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/series/any_value.rs: crates/polars-core/src/series/any_value.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in polars_core::series::any_value::any_values_to_struct at line 978. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/series/any_value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/any_value.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"94224112178cc5c69bb144ffd10b47431792a5e24a174ac4df25e331a277ee08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ProjectionBuilder::build_projection at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/projection/builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1a2ad89ff23502b05a07d3c61968f6bbdb9fb9799ce0c1fe6bcd5c3bbfd7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs: crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in polars_plan::plans::optimizer::predicate_pushdown::hive::rewrite_hive at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b727b9a7d1aba41f61cc183a70799c7457e9581f572b100f6d9b1599058eab3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-ops/src/series/ops/round.rs: crates/polars-ops/src/series/ops/round.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RoundSeries::round at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/series/ops/round.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/round.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d605dfb125892f75b2817fed3303068d1c8915e2af6b409cd537c0a3f26e75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/optimizer/stack_opt.rs: crates/polars-plan/src/plans/optimizer/stack_opt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in StackOptimizer::optimize_loop at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/optimizer/stack_opt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/stack_opt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6a2ece69f389e3943495bc020afe3a5c7e821ea55f076f9cf6c5efca4186b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/joins/equi_join/probe.rs: crates/polars-stream/src/nodes/joins/equi_join/probe.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ProbePartitions::partition_and_probe at line 410. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/joins/equi_join/probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1877d9be7514e739eae6de1f87d232752d5be81ba02f32f472e05e5b3a4ff237"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs: crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PartitionDistributor::run at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/components/partition_distributor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68c6f4b89d367a50eff4e1131ee67befc19894070f20aec88a9d541b1c3af30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/chunked_array/ops/append.rs: crates/polars-core/src/chunked_array/ops/append.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in polars_core::chunked_array::ops::append::update_sorted_flag_before_append at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/chunked_array/ops/append.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/append.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ec9e752d85c18bed6d194d887fcdf56beba18b84b503c680a06d036319774f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs: crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in polars_core::chunked_array::ops::sort::arg_sort::arg_sort at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_sort.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"920eb10cd97519595c769fb9fc8a496d54f3d536dc78e70af10b520e90cc032f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in polars_stream::nodes::io_sources::multi_scan::functions::resolve_slice::resolve_negative_slice at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_slice.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"750d424b62f817fbedad5cda50bcafd7cac062867c62b38393d16858983911f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs: crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LineBatchSource::run_parallel at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d20ce591a97b85e12c7dee90d36080afefaced317455a1a5744710e6856b49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: py-polars/src/polars/io/lance/_reader.py: py-polars/src/polars/io/lance/_reader.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LanceFragmentReader.collect_batches at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- py-polars/src/polars/io/lance/_reader.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":"py-polars/src/polars/io/lance/_reader.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"837a1b5b57223e25d80a386e8104e51370fe470b63d94b5d55fd86e1313d9d83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/expressions/gather.rs: crates/polars-expr/src/expressions/gather.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GatherExpr::evaluate_on_groups_impl at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/gather.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/gather.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de96b2af5769f0f70da0916d37981fc8ec9ff92dcdb4da5cc3d1c96a1c4a16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-parquet/src/arrow/geo.rs: crates/polars-parquet/src/arrow/geo.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in polars_parquet::arrow::geo::geo_key_value at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/arrow/geo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/geo.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f02ef9c2b5425a5fa187def0194f04ed37ebabf7efa7cc8ac248bfffbf0751"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-expr/src/hot_groups/key_rows.rs: crates/polars-expr/src/hot_groups/key_rows.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in KeyRowHashHotGrouper::insert_keys at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/hot_groups/key_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/hot_groups/key_rows.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6428aaf7d7e4a47c0253e0ec8dc9ad83821f8a75a5705be294eecff9c7c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs: crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in IRStructFunction::get_field at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b874d7ff4cabc1021b88a451d014ba34a12a7dca0ee33c9678d84c0ebef1e4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-expr/src/expressions/sortby.rs: crates/polars-expr/src/expressions/sortby.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is SortByExpr::evaluate_on_groups_impl at line 292), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Sort with limit in in-memory group-by (#30563)\u201D; \u201Cfix: Allow empty groups in multi key sort_by (#29825)\u201D; \u201Cfix: Broadcast scalar inputs in \u0060min_by\u0060/\u0060max_by\u0060 and \u0060sort_by\u0060 (#29808)\u201D; \u201Cfix: Handle reordered groups in sort_by (#29639)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-expr/src/expressions/sortby.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/sortby.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a327d478a77b9a01f24b91ba361dcd3cbba1e63c4c2ff3145e78e055b49465"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-ops/src/series/ops/log.rs: crates/polars-ops/src/series/ops/log.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is LogSeries::log1p at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Make \u0060Expr.entropy\u0060 corner cases consistent across engines (#30699)\u201D; \u201Cfix: Reject non-numeric input and preserve \u0060Decimal\u0060 scale in \u0060entropy\u0060 (#29228)\u201D; \u201Cfix(rust): Return error for \u0060log()\u0060 on non-numeric dtypes (#29193)\u201D; \u201Cfix: Error instead of segfault for \u0060exp\u0060/\u0060log1p\u0060 on non-numeric dtypes (#29112)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-ops/src/series/ops/log.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/log.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"61187d4bbd82ae94e3d5fa8cecb2c7f63311eeaa177b0934d0d096c26291f449"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-sql/src/group_context.rs: crates/polars-sql/src/group_context.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is GroupContextSplitter::needs_post_aggregation at line 125), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Read SQL column names like \u0022*\u0022 or \u0022^a$\u0022 as names and respect WHERE without FROM (#30440)\u201D; \u201Cfix: Apply SQL \u0060SELECT *\u0060 options to the wildcard columns only (#29854)\u201D; \u201Cfix: Support SQL \u0060HAVING\u0060 without \u0060GROUP BY\u0060 and check columns outside aggregates (#29833)\u201D; \u201Cfix: Fix small bugs in SQL aggregates and in group contexts (#29754)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/group_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/group_context.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c9a72b01cf0110d774e4ed290e0ae4919ad5354a70b9ae9e940535ed861d7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-core/src/frame/group_by/aggregations/dispatch.rs: crates/polars-core/src/frame/group_by/aggregations/dispatch.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Series::agg_mean at line 369), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Allow repeated indices in a group in debug aggregation checks (#30771)\u201D; \u201Cfix: Clear the sorted flag of aggregated literals with empty groups (#30461)\u201D; \u201Cfix: Clear the sorted flag when first/min/max leave groups empty (#30427)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-core/src/frame/group_by/aggregations/dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/aggregations/dispatch.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e677fce8a287679fcec1951e86e89db24d7450c9988150b5b22dca188798c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-python/src/interop/numpy/to_numpy_series.rs: crates/polars-python/src/interop/numpy/to_numpy_series.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is polars_python::interop::numpy::to_numpy_series::series_to_numpy_impl at line 72), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Do not read the values stored under null \u0060Array\u0060 rows (#30286)\u201D; \u201Cfix: Raise error instead of panicking on out-of-range datetimes in \u0060to_list\u0060 (#29918)\u201D; \u201Cfix: Various map issues (#29147)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-python/src/interop/numpy/to_numpy_series.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/numpy/to_numpy_series.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"145f8349c5b9ebe8ae056f85f8b6bb27befc4a66434ae4e42501f84db81d4054"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-plan/src/plans/aexpr/function_expr/cum.rs: crates/polars-plan/src/plans/aexpr/function_expr/cum.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is polars_plan::plans::aexpr::function_expr::cum::dtypes::cum_sum at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Fix schema errors for \u0060UInt128\u0060 cum ops and \u0060Null\u0060 truediv (#30584)\u201D; \u201Cfix: Keep Decimal results within their declared precision and round Decimal to float casts correctly (#29539)\u201D; \u201CRevert \u0022perf: Coerce float literals to decimal instead of casting the column\u0022 (#29503)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-plan/src/plans/aexpr/function_expr/cum.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/cum.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ded917b1a70c7c25d4f3a6b225e45631ce2288370228f195b52416c14b719"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-sql/src/grouping_sets.rs: crates/polars-sql/src/grouping_sets.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is GroupingSets::aggregate at line 243), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Read SQL column names like \u0022*\u0022 or \u0022^a$\u0022 as names and respect WHERE without FROM (#30440)\u201D; \u201Cfix: Fix wrong results and name clashes for computed SQL \u0060GROUP BY\u0060 keys (#29965)\u201D; \u201Cfix: Fix wrong results in SQL REPLACE and ARRAY_AGG, join_where on decimals and sorted group-by keys (#29823)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-sql/src/grouping_sets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/grouping_sets.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"385d4f357e5c012038cf5aaa5365aaf86e966ea4f0f6a86fac6fa86c77082e38"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/post_apply_extra_ops.rs: crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/post_apply_extra_ops.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is PostApplyExtraOps::run at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Fix slice returning too many rows when Iceberg position delete is past end of file (#30412)\u201D; \u201Cfix: Make distributor linearizer capacity consistent (#29057)\u201D; \u201Cfix: Reduce memory in multi_scan pipeline \u0060PostApplyExtraOps\u0060 (#29049)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/post_apply_extra_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/post_apply_extra_ops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"32eded8954429574420c8692a5aeee3854128b474ebcadd974b99976efbdeb78"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/polars-parquet/src/parquet/write/statistics.rs: crates/polars-parquet/src/parquet/write/statistics.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is polars_parquet::parquet::write::statistics::reduce at line 120), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: Correct unsigned parquet stats merging (#30199)\u201D; \u201Cfix: Write valid Parquet statistics and column index for NaN and nested values (#29868)\u201D; \u201Cfix: Decimal Parquet statistics for decimal/i128/f16 (#29350)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:53:10 \u002B01:00\u0027 --until=\u00272026-11-13 22:53:10 \u002B01:00\u0027 --full-history --no-merges -- crates/polars-parquet/src/parquet/write/statistics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/write/statistics.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"560b7453542c2e1b3f3dca9f9373f589ebe8e2fc0818f28aff310e45f0fc558a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 38 significant file(s) lose their only recent owner: crates/polars-arrow/src/io/avro/write/serialize.rs, crates/polars-arrow/src/bitmap/iterator.rs, crates/polars-buffer/src/storage.rs, crates/polars-arrow/src/array/union/mod.rs, crates/polars-dtype/src/categorical/mod.rs, crates/polars-arrow/src/array/builder.rs, crates/polars-stream/src/nodes/joins/cross_join.rs, crates/polars-stream/src/pipe.rs (\u002B30 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cd3c1c805739141714334c96c1558d86f389ebad12521484896ba399e4967fc3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 24 significant file(s) lose their only recent owner: crates/polars-plan/src/plans/optimizer/join_order/cluster.rs, crates/polars-stream/src/nodes/joins/runtime_filter.rs, crates/polars-plan/src/plans/optimizer/join_pushthrough.rs, crates/polars-plan/src/plans/optimizer/extract_window.rs, crates/polars-parquet/src/arrow/write/nested/dremel/tests.rs, crates/polars-sql/src/group_context.rs, crates/polars-plan/src/plans/optimizer/join_order/enumerate.rs, crates/polars-expr/src/key_rows/map.rs (\u002B16 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d45b75afa0c2e5cf94f95a96ce51ba6398d7dd02c6b1a955ddd192c5130b19c1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 15 significant file(s) lose their only recent owner: crates/polars-stream/src/nodes/io_sources/multi_scan/components/apply_extra_ops.rs, py-polars/src/polars/io/lance/_reader.py, py-polars/src/polars/io/lance/_scan_resolver.py, crates/polars-io/src/cloud/cloud_writer/bufferer.rs, crates/polars-io/src/scan_lines.rs, crates/polars-plan/src/plans/optimizer/projection_pushdown/edge.rs, crates/polars-io/src/file_cache/cache.rs, crates/polars-utils/src/row_counter.rs (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"17af40a03d91fb8f7b297f64225feee0c3c46dc809c910b2eca93f5aa5810689"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 14 significant file(s) lose their only recent owner: crates/polars-io/src/cloud/concurrency/mod.rs, crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs, py-polars/src/polars/io/iceberg/_cache.py, crates/polars-io/src/cloud/concurrency/admission.rs, crates/polars-sql/src/table_function_args.rs, crates/polars-parquet/src/arrow/read/deserialize/primitive/fixed_len_decimal.rs, crates/polars-io/src/cloud/dns.rs, crates/polars-compute/src/gather/list.rs (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"660c5caac0ee89aed0089a9fea15125c7016636ba0a9f348046032c77f90c072"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 7 significant file(s) lose their only recent owner: crates/polars-core/src/chunked_array/logical/map.rs, crates/polars-plan/src/plans/aexpr/canonical.rs, py-polars/src/polars/expr/map.py, crates/polars-plan/src/plans/ir/canonical.rs, py-polars/src/polars/series/map.py, crates/polars-expr/src/dispatch/membership.rs, crates/polars-plan/src/plans/aexpr/function_expr/map.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b3c97e0f9c2dc13032cbd8447ca5b4bad1be32fdf13f51296afe1d10cd838ff"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 4 significant file(s) lose their only recent owner: crates/polars-parquet/src/parquet/encryption/encrypt.rs, crates/polars-parquet/src/parquet/encryption/ciphers.rs, crates/polars-python/src/io/parquet_encryption.rs, crates/polars-parquet/src/parquet/encryption/modules.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"30095bd61c012bacb777e7673fec316a1e94de3b0ef7c3d86102de3fdb00e056"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 4 significant file(s) lose their only recent owner: crates/polars-expr/src/reduce/approx_quantile.rs, crates/polars-plan/src/plans/aexpr/function_expr/struct_.rs, crates/polars-plan/src/plans/optimizer/collapse_sort.rs, py-polars/src/polars/_utils/expired.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"96aa26360c58e61c72b10103969d7ac7c0fc79845526408003d0d1980a7d1d3c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 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 (109 single-owned of 1573 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; 1573 of the 2290 production source files in this repository met that bar). They are anonymized user #8 (2 file(s)), anonymized user #9 (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: crates/polars-defs/src/time/group_by.rs, crates/polars-time/src/windows/index_space.rs, crates/polars-arrow/src/compute/utils.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":"pyo3-polars/pyo3-polars/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dbeff624116f4ee1cca571dd3efe7f88e4e6886b0b55c5afdd8bda64050ca2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Re-enable this check when this issue is fixed: https://github.com/pola-rs/polars/issues/10466"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/streaming/test_streaming_unique.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7696021a56a0f252e48c80bf403290351a6b5532882981f33c12c2ef820c7df2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: negative intervals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/sql/test_literals.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e63519512920ff4e9ad94c45239b29b89b1bbf591acc4985ef964a520c8e75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Do not rely on I/O for these 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":"py-polars/tests/unit/sql/test_strings.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb390cf373949473967b71e8c1b7ea8c943e820600b6c30f27ed67b1e3d8328"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we want this to work? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/series/test_series.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9154b412fc64966abe315da0df6725e3caeabf1eae98f403db48a467636cd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: time arithmetic 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":"py-polars/tests/unit/series/test_series.py"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99648dd1f3331da5dfcf4aecf1d6dc66d3512cc9f0f9b4ccbfa5af3f34ac986"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This test requires the environment variable to be set prior to starting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/test_rolling.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"006e4c5ef5ef282df358edff2a5bdd6e9a836578c9e46acb31bd448fb80c1eda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This test requires the environment variable to be set prior to starting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/test_rolling.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a114748ded5fe324e33ada8e4b1edc4241302f00a4428ca1782e821f7df182b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # assert pl.thread_pool_size() == 1 # pending resolution, see 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":"py-polars/tests/unit/operations/test_rolling.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09014623a39962ec758e34bdf366679446f29ec96ea3363908366b52dba15fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # assert pl.thread_pool_size() == 1 # pending resolution, see 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":"py-polars/tests/unit/operations/test_rolling.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"defab31c8b10300835455a741174baa7e0b81a7e07e15886bdacbc962f09159d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: There should be a \u0060columns=\u0060 parameter to 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":"py-polars/tests/unit/operations/namespaces/string/test_string.py"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"293cc80ae3fec2ce7543f9040c9e7da57b13a9bf90d15c181dd518c943501b52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: There should be a \u0060columns=\u0060 parameter to 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":"py-polars/tests/unit/io/test_json.py"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9666d0d1c69452cf59b52b4b6cd69795c4d00a2865eb83b2d37d47529fba04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: there is a bug in list.slice that does not allow negative values for head \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/namespaces/array/test_array.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d6c9a8d6c21bc6893522f5c0333d939790507e93c6a7b22c0e71326d6dc83c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We get an error on non-lists with 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":"py-polars/tests/unit/operations/arithmetic/test_array.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5248d213900df6b2b8cf0cb254c312f546207687413587fe7628b5e8199b19a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We get an error on non-lists with 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":"py-polars/tests/unit/operations/arithmetic/test_list.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8c40a1a83d9d25addbd1dd1a68d809b524405fed9b21cc86cd2058d4475e8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Make the error type consistently a ShapeError \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/arithmetic/test_list.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"133f52b6ee88a844478527c88b59a9da6eaf5b464f2a221a9cf65e524cd70b9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(_): Ideally this always raises InvalidOperationError. The TypeError \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/arithmetic/test_list.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff3a6ef1899e92381206a89556b68f1515ee53d4594dcd75ef07d79a5940b35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this exception when #24509 is resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/aggregation/test_aggregations.py"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe2c6329e4ea34949a31110bebb1b2fde1f3e9fd859b56ed28a632c557d02c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: polars/#24936"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/aggregation/test_aggregations.py"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5631f002ad09758cf21886866407b82dfab6d673259941bc3359a47cc48333"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: polars/#24936"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/operations/aggregation/test_aggregations.py"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"6512f71cef62786380ad284fb0bf0a77fe742d1ec43457e7b9da7d9807a3baad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add more (bitwise) operators once their types are resolved 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":"py-polars/tests/unit/lazyframe/test_schema.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33d42eff89703e81ee66c2524304848740dacea97290c333eb135053b436c2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: uncomment dtype when fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_delta.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8389caf6f9a343acd58fff08c2358a7181117f312319ff90e22cb65b6471d5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: expand logic and test case to cover tight_bounds=True; 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":"py-polars/tests/unit/io/test_delta_deletion_vector.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9170a6163b2559521abd3c691fa64c592fa2aa6963cce0dd8526eb7b1fc51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: known issue: no message is printed when the resulting df is empty \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_delta_deletion_vector.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec768b5cab1cb4362af6d3c2374fbe249f0ec9d5f8e13e4b2f21c65e22e8a8bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # (pl.scan_parquet, pl.DataFrame.write_parquet, \u0022parquet\u0022), # 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":"py-polars/tests/unit/io/test_multiscan.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab859c613c34b5f3c577224ed356bc2aaff7be8575ebe19e55c1987fc6f20d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # (pl.scan_ipc, pl.DataFrame.write_ipc, \u0022ipc\u0022), # 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":"py-polars/tests/unit/io/test_multiscan.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bccf267d176af5b21409edbd3b6f4caad37017ba44f36f7b3b95cf312e7c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # (pl.scan_ndjson, pl.DataFrame.write_ndjson, \u0022jsonl\u0022), # 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":"py-polars/tests/unit/io/test_multiscan.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f82249c1521d4ffd433168e575778a7c92a35b909ffb5274319732ba751e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: panic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_parquet.py"},"region":{"startLine":4849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e607845933c0458a60cdbca28bb6f963d1ec765b579ecc342a3178b186d22ece"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make lazy via callable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_plugins.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d71ef06ce61b20951b8c1be88f9ccd8f4ef6860edf88a3c763355fde3b17e27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: glob parameter not supported in some scan 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":"py-polars/tests/unit/io/test_scan.py"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f473235526269af2f88140d3e477611fc431515eed3fe4b55edd3ea7e25a14ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Fix for all other formats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_scan_options.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b4a280a22be7c4779d3085294941ae41c26f6071b919c0c774ca486fef4070"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: flag that trims trailing all-null rows? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_spreadsheet.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a83577286e7a7e6c39cd8cd09b057ae000cf0012096805f59042747f15ed66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: uncomment once fastexcel offers a suitable param \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/io/test_spreadsheet.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2157f5da513527e1ef39b96890e37f8fab0a4edf6429a0accbe0ce744829e31d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: write_ndjson cloud 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":"py-polars/tests/unit/io/test_write.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0097204b380c83efe3b8932ad1be020f5823d65c0cf8059adba92f5ac17eb085"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add Parquet round-trip test if this starts working. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/interop/test_interop.py"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73f0423610c6fba4b15d3e338ef7e681c5238ff04ce8a46403e2f47abe1dadc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable lexically ordered categoricals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/interop/test_roundtrip.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaa657cdcc419db7d813c92072336a6ef8b74969e609ab96b992d0b10682758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add Enum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/interop/test_roundtrip.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd24534a89033088a56a4ad22144ed093669f24b955248ef8d783b2c72fdaa1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this shouldn\u0027t be allowed and raise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/functions/as_datatype/test_concat_list.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bf1ddc71d6089fa96f006ed3d8bce467667697761f0652bc61532811ff3188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test eq_missing with nulled arrays, rather than null elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/datatypes/test_array.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c2c3832df43db1b990e725d32713edcbb3e697789098d117d0a44dfa064cf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check what happens if there are strings, floats arrow scalars in the list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/datatypes/test_decimal.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e645334b5fce6231c87c55243d8b9dad9d4e49752d9a5ce20529e37d2e5fd841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we want floor instead of round? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/datatypes/test_decimal.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece7b2bcaeef152f6b256f63e4c370d6ef668e0a3c34220abdc30a7d072055e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: polars currently doesn\u0027t retain FixedOffset timezone. They will be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/datatypes/test_temporal.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af1821effcdffcab40a7040ae0c445411b3f81b8e074ee5def9ac874e83fc83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: polars currently doesn\u0027t retain FixedOffset timezone. They will \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/datatypes/test_temporal.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e948a0a023252667f02e1fc008fbf2b39fcea960196519ead49a04810c7e14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make pickleable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/dataframe/test_df.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"761171180f91331674e5196a6a3d1b11787093c5ffea6cc7a28b3e8c4d7757d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace direct calls to fallback constructors with calls to the Series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/tests/unit/constructors/test_any_value_fallbacks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22c012153e1654a160f482262003d66738e066408b6f1fabd5a0c302dc06ebf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: How to check that this optimization was toggled 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":"py-polars/tests/unit/cloud/test_prepare_cloud_plan.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a2052b327c2957746b2bdc2e6a30870a24bc815f784c33c9d3dd48d475773d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove in 2.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":"py-polars/tests/docs/run_doctest.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a37e7b433b0f577df63f361af70e7287512d94aeef327c7019854175f641c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove need for importing wrap utils at top level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/__init__.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9f5f13756470b4bcd501f2b0731a9045906219fbc7fb07822d8bc210f35b35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Don\u0027t use this as it collects a schema (can be very expensive for LazyFrame). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83d350f75ab0dfcb5427d38859c61df28d21c8bce6676befea430d47a99fa01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Don\u0027t use this as it collects a schema (can be very expensive for LazyFrame). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6dc4e2e6aad48044fb3131ab640842adf450a851087730d7ca0ff5992c5f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: allow explicit selection by scale/precision? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/selectors.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b4d91a6ccf3bf1d1676197e9e394156d5cb1d7d9c3ecac7378468331009ef4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable full range of millisecond durations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/data.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72421aa57fd40835603cbb820b880bd472b59c210c5a0384f8550ae92adb987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable Object types by default when various issues are solved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/dtype.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b640c2b86dda192fa8d8002b0f9bc47c5f4d7cbab23e12987b7c02739909ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable nested types by default when various issues are solved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/testing/parametric/strategies/dtype.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7059d1ddf007e98dcafc9d9f7db0a0de5b5ef7b125d8af7b97ac2f895cae6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: either make a change and return py-native list data here, or find \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0fc87f44a4ba15dc73fd17a275a70ecb96c66c82ad2e6da055e396dab8d040"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement for these types without casting to series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f29698a453bd24e20ceaa07107b054e22236da0f41d539c0c43f6c99d5ebda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use variable-length strings instead when NumPy 2.0.0 comes out: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1577cf9135792403f5f6b72e2b27ffd5398f6d9f454c9a9f07f149a3975cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Only raise when data must be copied \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/series/series.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ebb9c251ba8b3ef220f1bba2e85133909eca7f523f847debb9691363ee971"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Only raise when data must be copied \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c9b0df71b0373134103998e9a602088749c5d200374f81e9713a59855059ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is there a better way to do 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":"py-polars/src/polars/series/utils.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecb9b28c2f2ef0b817dd2565c1e747183ee5717adfb2d6079bf9d75f628b93b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: At the time of writing, polars_nanook (formerly polars_cloud) fails to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/meta/versions.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbb7dc4b8404c70eae0bed9b539b51a06f14e0211b42f63b62fd2072f5a2095"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: don\u0027t collect 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":"py-polars/src/polars/lazyframe/frame.py"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"242eb92fafb6b878fb1b8984a0d2dc9397fc63faf1869f1bb11b341cb125dae3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Float 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":"py-polars/src/polars/io/iceberg/_utils.py"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b68c15c7f6489d779b960de37fed97070d27895953164d6e962df67487ae6b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is this fetch_all not supposed to be from the argument? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/database/_cursor_proxies.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"639440921e9a51a4599916629088dd07fb434e2dd58dc8165675a7c0351765f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # noqa: D417 (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":"py-polars/src/polars/io/cloud/credential_provider/_providers.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d339f07eb95eaa41f539cc2348cf2e62d662c01b2c36eea1e8f9be080447ead"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # noqa: D417 (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":"py-polars/src/polars/io/cloud/credential_provider/_providers.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"537690830c929ec945c1aede790258129586530f97c0c11eca2d3f28c01e718e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Interchange support was removed, but for stability reasons, \u0060CompatLevel\u0060 has \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/interchange/protocol.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b98bd33faf4822971680fffd5a4c06adedf5d6f690452de348f913b2f8dbf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: further-improve handling for nested types (such as List,Struct) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/datatypes/convert.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6ef42a5c3f9cbfa8a2f57ccb91321c26cd5ae8c64af94af0263c4295c8a5d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use python sequence constructors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a783272e634d2a8e0599479cbc6f71c81440f787bc2f01d42b4777598ec2148"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we can parallelize this by calling from_numpy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec60451af4a4faa9157975873596c9ce298e69ed959ed29010457dda230cb6f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable warning for inefficient map \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":8924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83bc7577badf1c958693b3385ea8dcca02bd02e80c680f37cc435ba92a47031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # \u0022abs\u0022,  # TODO: this one clashes with Python builtin abs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a202e7271fe015b4fa0a0f48d23195e44c557d744054bf4b40c5b08aef49fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dataframe.map... ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/udfs.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"169335f24067abb8116fbacc798459c377a9c4a2c2b5d9c672b6cf2fa9f222bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: eventually go into struct builder \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/series.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc36556cdc0fdc1b11f4a9ed2763f80c110e7d3d9944af047e4d27e2fb24edb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use Hasher interface and support a random state. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/hashing.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6dc08c029c0777eadec960e76b40594668c707ef0d3fe3af9b8e7827988422"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should probably encourage explicit null handling, but for now we\u0027ll \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/hashing.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee99b9d3b033fa4d674f8b56d48509e884cd4661a56d4117c0e7d6dc945c4484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We aren\u0027t handling the case where the file is already open in write-mode 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":"crates/polars-utils/src/mmap.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36cb166b2c927d1530198511841599fa3db792163915d84b96a37908dce3945"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to actually register that this file has been write-opened and prevent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/mmap.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0428f8d19bb7dfabe2bf98ee7ff0ebb098310ff9dad674537ae3bcd60f74850"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add larger global cache which has time-based flush. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/regex_cache.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0c18b0d5b871f6174e9787d24b27e24ab4fbe783e3e5a96998b748406f222f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: perhaps deletions could be done during a rehash by synchronizing on state? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-utils/src/parma/raw/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"618dfdeb9c2fb6e18254d3bf2f848738d98c6da9af99c483e4d12b306526c017"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find some way to propagate error instead of unwrapping? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-time/src/windows/window.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3409d390015f2f0d85f61656488b8e27e6fe99e632b52dcfcc7253e2c6b9a93d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how does the multiplexer fit into this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bec75b82bc3bd0a0f7466c857223da84289e412d84988580041125989f8135"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track this in metrics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35001d994a96fb87e9208d59b0117292818adc7ec7abffebeab56a4f6aed5dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track this in metrics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"64edb50c603bd0e8f15457dbe83750b02a5949ecb500d7dff5004872e59a6029"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track this in metrics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/execute.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a672713f97bb020784186cdecd779acbc8d473e3c4bb9e0eba5e672ddbc071e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // 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":"crates/polars-stream/src/graph.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad077d7c2fde12a965bfa57d8722f56098680135fb80e24cc0305c63ffb0559"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: experiment with 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":"crates/polars-stream/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e25df4ca2b28c68ba561e85b73107f4c6cb757555e7847feac64ac7fbead1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use least significant bit to indicate \u0027last morsel with this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/morsel.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b77f5cc2e7da1dbbee8517634ebc8287011a19a262624a1b5e2dcb56f46200"}},{"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":"crates/polars-stream/src/skeleton.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b436010a9c74cfb71084785cee2bb31c3e62bdbc3f48231d87a8c49fee9d50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we shouldn\u0027t always do this when recursing, e.g. pl.col.a.sum() \u002B 1 will still hit this in the 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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2ab42ec29a44454e9602ea03ba104340b99999d8f64abc38e962e898d2b614"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lower through IR instead of duplicating logic here, need to pass ir_arena 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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d69e1fac756d20145d7eadc600085c6f033884a00a877178282926cf4267719"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky work-around: append an input column with a temporary name, but \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":"crates/polars-stream/src/physical_plan/lower_expr.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9b4f4b52b76c25f8ee715541aba5d1492052c4bf864924206b1199965c27bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow all aggregates, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3b2517282d6e7afd95acd860ed4725f0108783e3383a84aba3fcead84964d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"173585cacb2bffad47f90e806574609f916a0bc64933e1ec411639ad76997635"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"976903e3db17fcd7861f490dadba7ce7d546106bb86ac5e8eba71a476fc6621f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527ad232a3f615761987ca11af7c58f7093acd5cc017d887976a1af2fbc0f4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/reader_interface/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c9df529e6fb53e0b603f2842b8c2151018227f1a398d77d787e4d0850e3a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: projection pushdown on left side (original input). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_group_by.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e52cac08a19319d1e2afb9db55e0b58c3b0e542881375ce115d804cffb559e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We ignore the parameter for some scan types to maintain old behavior, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7752bd3b73f0a426df627383ab03c9560998bea57a763f7b14ebcd4a4fb25384"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure out why \u0060input_schema.try_project\u0060 fails below with e.g. \u0022\\\u0022_POLARS_TMP_7253\\\u0022 not found\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":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8e33ac662436cdc9c4d6e4c197eea9d13b589dc2a6ebd6d39b59a6413b3162"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this after fusing pre-select into group-by 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":"crates/polars-stream/src/physical_plan/mod.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"426722c6585e0f4cdf5f7f207d702b92664a1ac814d0a6ca608afc1a938465cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this to a FilterNode so that it happens in parallel. We may need \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/to_graph.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c4211adfe2840ee88da4316e517bb66974896c0f68296d3e5374ca64f321da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this hack. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_source.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c34c60638d238d2a5b053137c736285c4807b7f8dcdc754a2801bd0fca93b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can this just be serial, using the work distributor? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_source.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"523980a89fb882e9d9db37e5a2ff5bdcc49a236f4da960396b162fd4bcd4c37f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this \u0027always send at least one morsel\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_source.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0701ee30f8788cb1994f36b732b7772dac896be152b527488acbe56e7c653ac7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parallel multiplexing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/multiplexer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636b661e02cbe60e152845d757dc21890836c6c8b5c5ab73106550287a489e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: categorical single-key. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/top_k.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bfe7b6e081fff8a08c6f8172300f46414fbd13ab310b90d64524cc3e68e003"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recombine morsels to make sure the concatenation is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/zip.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e9a624212f874790d2a9ec76fb12e176f58d7d43a9e000576413e42aa8e26e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: size 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":"crates/polars-stream/src/nodes/joins/cross_join.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3194704814770aac94d20888089f20099ccd621541a0a82ab5e2e6837345c806"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve, generalize this, and move it away from 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":"crates/polars-stream/src/nodes/joins/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9051e6e1977cba5be0ea7d2eacbdc7a3513862a8ff23b0cc642c3a1c725cf9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unfortunately we can\u0027t actually stop here without \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"602bd7d0cbe2932a1c1940ea0dcab33ca234cb6d20c21c18610856da7c8b06c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t do string-based column lookups for each dataframe, pre-compute coalesce indices. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59b9924ba87a058857d9084544b75969bcab211165588eeea4fa886ef913fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: shuffle after partitioning and keep probe tables thread-local. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13e679f92874263f3fbdb5fc7f5c99cda6c9c3bc6735861bde2449886574cee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement something more re-usable and robust. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"70615d1dc7412fdfa7c51b2f89fcee6fff2d2387015b7f783e6eb1d41e52558f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parallelize this operator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/probe.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"46758508f9d7e0c9528edfd92e3a2f945d26b9322b0b602c99837ecae61df6d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the window can\u0027t grow while an oversized fetch is running, even if the pool has \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/shared/pipeline_budget.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be9231ea2594a6e0e8ef3f44ba5d915a5fa1c9813be25e3dc13a607c8481a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor to avoid full clone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe6a178a39260cde573514cc9eec547b00c0d006ef6c0038b8ae9e75884ea0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_data_fetch.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"979f6f0dfd4a0a69b89bea1a0b3a8d4298cb90244b259a044144c36b897857b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also load in the metadata. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/parquet/row_group_decode.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb4ad4e84289a9eef3b7a5a653870af1da4f26eacd009d027f045fa2d20490b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO REFACTOR: use get_streaming_chunk_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":"crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b06f16e88ef887eab6db560a517c087675373f483f0d7f40eb7d1b1d7c1f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use less restrictive default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/reader_interface/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab1b2951ecb67daa907cbf10e6169293f30634c3893cfd49c2fded5f6e0360f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/tasks/reader_starter.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6fc234a6bbfbc17f2d231681526f64a8c1a1754f5f2c7f21fb85ac82020222"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185d768647434e35c5b1cc33ff939a8bda9dbea2a160ede544c75618e2f12d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/http_rate_limit.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"31915c3b5c412c5c2ceb545488aa07e56861a00d5f08ac90175edfa1013c0c8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: One day update IR conversion to avoid attaching these to the file schema :\u0027) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_projections.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bf94b6ec9f5ee6c848288d00522c4533ee1bc716c7e65c1f22d7c98378f29b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update IR conversion to avoid attaching row index / file path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/functions/resolve_projections.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"00748d4a2d44121277f15bee0c3027ee091d85aa5bc5aa4a9e2aad08dad53a13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bitmap-based deletion vectors (e.g. Delta, Iceberg V3) are sized as the exact \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dc5a3df7c61c9400b27309eeb3bbfce6c104bc9972046028470210bce2cc0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revisit the group size once the in-flight budget is sized for large requests. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/record_batch_data_fetch.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b35d9b040f1cca3b6cfc3dc1acfe7c59293c749b0a13e55b9fab25bab7a8afe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Native line buffering for negative slice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/line_batch_source.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebed6d203d30a0300f78e319faa76ff021e76d2e9eeb71bcba720fc6d12b6252"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO REFACTOR: use get_streaming_chunk_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":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c840e04afb3184ed84ab7051f6afbe7a051bbabd5c3008a6bb3287572040ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor to avoid doing compression work on a tokio async thread 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":"crates/polars-stream/src/nodes/io_sinks/writers/ndjson/io_writer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e225709f4adf0aab1dae1c93302ae9f1255b7c90ff4b7d5b2c978c84d9b36e4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor to avoid doing compression work on a tokio async thread 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":"crates/polars-stream/src/nodes/io_sinks/writers/csv/io_writer.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f06d3b59982173c344031679a966b0f1d228666da3dde00911426c9b6566be0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support exprs in \u0060unique\u0060 see https://github.com/pola-rs/polars/issues/5760"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d80dcddb25c211b403640f2c8cb354ad2e56e4de026f93868ef904a4779a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support \u0027WITH ORDINALITY|OFFSET\u0027 modifier. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":5966}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b551b3571a2eda615b8146957346ce2e670f127346c3cfbe00abc013bf86760"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: will look at making an upstream PR that allows us to more easily \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6039}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea79bd39de0b175825b3ba1e1114173504bed4b49ce0536c9144aa269204897"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: might be able to support as an aggregate \u0060top_k_by\u0060 operation? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":6756}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5b4df9090de63bc5a5e453812ccc071ec364f6d9cb68c95eae417318aab935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement the following modifiers where 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":"crates/polars-sql/src/functions.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"96556c0cfddef1863ebc0ad7eefdd90669a4f68697f9495b7d63dcae59a2c630"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow compact snowflake/bigquery syntax? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac948991cdd6bfc44bf2e38fae4dfeff514f7cae2125c5a9b05dca6fe53fbbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when \u0027saturating_sub\u0027 is available, should be able \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/sql_expr.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb98074433bf777229fe6d8d688eb5b855f299decf16cfe1c3e576007e94ce2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we have to clear buffer 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":"crates/polars-python/src/file.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac93ad51ae4936994fbcfbf4363b282c33ed7a3d3671b1d0590998379b6e200b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we throw an error if we try to initialize while already initialized? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/on_startup.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c072f1a53c11f779d5298f1e7d386ffa4f7a86a6e89ed1348a51c481158098fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should return query results \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd30479abdeb72e77b61e85417648f8f89663b6d51e3a563d1cd804f11794c7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should return query results \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/general.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9b8b4828b7495a33a62ad9832baebd21e39ad852e9848103297f9c02fd6e84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should return query results \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25a8595918339744d6fda9d931ad288c473d0c96b65da8683015156bccd66a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expose 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":"crates/polars-python/src/lazyframe/visitor/expr_nodes.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"f079f61e5c374914eb451ab89ea3ca82f2065d540541550c81f7eb770c793bf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: file info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/visitor/nodes.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e782ae62c30e886c018873d5cb0807a179a92acede2df42fd026663267314d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check for nested nulls using \u0060series_contains_null\u0060 util when we support Array 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":"crates/polars-python/src/interop/numpy/to_numpy_df.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b27608a1eecfbeb8aaf64816b763d91d2afda6a5b55af58421ad8ccea4c2fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support viewing Array 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":"crates/polars-python/src/interop/numpy/to_numpy_df.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f001d6d635363f0422dd197f9a7900b7c1a081a5344f9b0d9bf7a4df14d0b2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Downcast the NumPy array to Rust and split without calling into 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":"crates/polars-python/src/interop/numpy/to_numpy_df.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b97d0a03b18ff4b3686a231b696172ddb974a543d74917646d3a4c54678d35c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: nested? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/interop/arrow/to_rust.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba0feddc434ed5a27e9565e1011fd5dcab70328b39d0267b5156502bebc45cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c83364451142f6500b2f07bda409abc832cbdb9655be8c3d5eec70337852c25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae5f3d8788de786fca1b135830653f8cc7eac6c158f15b2350875b3a5f898b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3d1624832f4f14e16561dde1fcc832c95c9084c10809736787b47a1a698a41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/functions/range.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda6ef5e3cbfd98e74d1f8b6fffac36c1d881edd50263a4c2a378e056cc8f8e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only infer dtypes for columns with an unknown 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":"crates/polars-python/src/dataframe/construction.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e429ed6fad80753fe9652e85ccb75fcd2c5ce4b6d44ff26b3055b01d2b2f8009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: iterate over the chunks directly instead of using random access. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/dataframe/export.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c0a336b5110a6536990909221f78566492a8ce167b4b43f9d50b841ef0a3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cloud 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":"crates/polars-python/src/dataframe/io.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43532d4334ab4a38bc9ad748e2413bb604b691f5b32af14bd4db168475118e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! (can this be removed?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/utils.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8251026e082e9528fced00dc3dd46b85229b37878c5174f8d3d87d23b3b32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Worth supporting? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3b08154a383fa2ffdb4cb91c3a6acb37706239135ca279fe2cffb27c2cd418"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Opportunity to downcast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/python/pyarrow.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b2a164233aa96ace54fef4528699f24d9ee073c44b940e59b900b514842a9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow timestamps once Microsoft Fabric OneLake writes their bounds exactly. The Iceberg \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/aggregate_from_statistics.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc5088445182df63b3a11f3b8f4e1e9142be5e31bfe3d96a7816ff14e04f365"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // are all we have. TODO!: change this if 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":"crates/polars-plan/src/plans/optimizer/join_build_side.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d2049eed5f452e2f0b0e5b921c81b5721bcec59821780e3af86349bbce10f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Simply checking that a column node is present does not handle e.g.: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"461dad8f3e8a677c0e9c819e52ab530e6fa7bd0d86944fbd37670e78b564f588"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! we currently skip slice pushdown if there is a predicate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"884741d3a36b012ae6ffa9fc1ce3ec67e50d5e2e2de7274ad57c405f086fd2b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be \u0060true\u0060 after Anonymous scan dispatches to new-streaming. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4bb510f39b659e1ab92b58bfd10fadfadfbd6713b5a03ed01f7a2d618ff1a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need an optimizer redesign to allow x \u0026 false to be optimized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c526a04252ad15e3e4bbd3c035a2d59c5eb483820be5b44a511d7e0d5434abed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need an optimizer redesign to allow true | x to be optimized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4657b3182fc78f2c9780cb5b5701f9d7d90fc503e0dfea04707f4249da184e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need an optimizer redesign to allow true | x to be optimized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/arity.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"066e98f6540f2d1a061ffd257cc508361527a67b8151b3e808b45f9bfbe6e07f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should optimize to \u0060null\u0060 once we can express \u0022is dynamic int but actually contains null\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":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ec2554de0b54513060e9efa06487b96b32882667a6918ef88b586b6a209b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should optimize to \u0060null\u0060 once we can express \u0022is dynamic int but actually contains null\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":"crates/polars-plan/src/plans/optimizer/simplify_expr/mod.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"26210e7a167a292c6f0f9aef6a1d6dd8d5957493fdb222120c17d0dcd79a5cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add support for cum_sum and other operation that allow reversing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/simplify_expr/simplify_functions.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"87487c0e6f721aea89bb166f8d751d126432842340855e694a612530d19cd19c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could rewrite to Distinct for non-dynamic groupby. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/projection_pushdown/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a85a2fe19304956d1cefcd1070d2e1e8967d6f625c382909774af3a4eed89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this goes into the branch twice. We could optimize for 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/hive.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b25900427ea1ca40f868bf1a012d4ecb3f77eb424fadc1903e3277e1469f71e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0bd7454aa7eeac1dc7f3b9db5703f0aa2057831d80123a2972e0ebec373777"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d120e9a490a2534c1f891430f75ebf87b803345729bc4e0392b98082cf8b9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow predicates on file names, this should be supported by new-streaming. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b7653dec1b56bb5c3023afe103a3dd3ff2facda2d1632416c161e8cce8bb4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t heap allocate during 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":"crates/polars-plan/src/plans/optimizer/predicate_pushdown/utils.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff383adf725889503280cd2697f0a0fd2141f07cce52a3b9c678c0da996e1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! Add a typed null \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/cse/csee.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d874fb2f690bba2ad214c7c24c7a620a3ef4c25c01ffb259ab06d54facf0445f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack UpperExpr trait to get a kind of formatting that doesn\u0027t traverse the nodes. \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":"crates/polars-plan/src/plans/ir/tree_format.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43e0ce578ccf6a5711b5bd0d1313f6ccaadd61f603246b9ac9a8916f1b36d61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! raise 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":"crates/polars-plan/src/plans/conversion/type_coercion/binary.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6872e054d33e73eec47f82320635c83ba61fdb22d22b0afcbf710d248f1447c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This must be removed and dealt properly with dynamic str. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7fcf78bf3aa5533a7f21c686bfb862edd7de2c1aa7993274a4c6cd5fb392a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: NonStrict casts are what process_binary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6cbf6da305f232859f4f190eea121acb8f66a4cebfff0989c5757320e325e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Non-strict to match legacy execution behavior, but should be strict. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/mod.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f329c80b9e3ad74858eb13c38841bb61516358629b9ee5e00f890d4d9df4ace5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! return metadata arced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"be031059e52993e4c62dd1d33f9ef5aac46b1324c200a64e34398202f218209b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO. We can do (much) better by collect statistics as part of row count and/or 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":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab803ee9966d077f130adeb9df20d7dbd0ad5f2370831e1788c0b5346d27812d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: flatten to single level once Schema::to_supertype is commutative. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5349bff5bc1504d5c4c28706a2c44925aa3f4fcaf0b4e898866bdb158a84f6ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO. Support IOMetrics collection during planning phase. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf57038d93b9e04245e059f89ff5b43fe447ad53336ba46aa02472c7157fa97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Reconcile the \u0060resolve\u0060 strategy with the cache capacity to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"515084423b1008ae4e268faa112f6eadd8062a3cdbbef7d56692ff7eab758d51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // This matches the engine output. TODO: revisit pending resolution of GH issue #23797"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ac21466fc1631d457484ae8fcb451355e99e20a24486a8d30bb36060edc74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // This matches the engine output. TODO: revisit pending resolution of GH issue #23797"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c979f2985dd09fe6820a194eba72da2636a5e749f36cd2bed3f3792062ddfe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // This matches the engine output. TODO: revisit pending resolution of GH issue #23797"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f95b9e5b9453782667ab84bd5821eda62d0597cd81806d010786015ce5354"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should not use \u0060try_get_supertype()\u0060! It should instead recursively use the enclosing match block. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2f98990e0bcabcfc793d592d7c570276a92cb31e4792309c2a7eaaf056311b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Re-investigate this. A lot of \u0022_\u0022 is being used on the RHS match because this code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/schema.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e9d27c449678fd0a26439c0bbad2cd8d3630ac4b51c688c8a5bf63076fb6e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only decimal product is order-observing, we should get schema here to indicate \u0060NON_ORDER_OBSERVING\u0060 for other 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":"crates/polars-plan/src/plans/aexpr/function_expr/mod.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa51f94881d3b025543d4e3db867b57d150a4a23f5da71417df9f1a433177ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo!: make default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/options/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f578054b1dc81316195b83687c78c4ea6d3dccd7290439e075ae83570b43887"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Refactor \u0060first_metadata\u0060 semantics and the invariant to enable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca38dd2593c9bee448d48ac73959216ff5fd948657392cfbe7cafe63b24efe58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: a planner-side pass could pre-evaluate static predicates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/metadata/file_metadata.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3cadd726626d108c34cd370ac1ebc75c09a15cc094e2dcd8b73a83969baa0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this take converted and logical type, for compatibility? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/metadata/sort.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8693a22480c7105bc9f25d0b585a4da73056b346dd941de99c40a6a4e57a87b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In GCM-CTR mode will this need to be a non-GCM decryptor? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/parquet/encryption/decrypt.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca7b980e79eaa2c5573d088395b44e96485dc2ca2c46bd89dc56355886f9d6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change after addressing ARROW-9777"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/schema.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0791c32d6cfb726a75266548818bac4a6e185706646a1a64f124be3bf5755be5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! reserve capacity \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binview/basic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a4d96008a73b7e6359c3855b683de54b94ad76b23a58cf7e5eefbdae472b1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Performant fix would involve refactoring this (BinaryDecoder) to also store Views \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/fixed_size_binary.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4982fbd03287402ea7c93f72de5ddc85aaa140e636e548a645f4e6bb5d379f56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: See if we can row-encode lazily. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/approx_quantile.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1299ad73e5fb7a4fab1da0eb056db836f95b0e3902dfe6d53a4cec16098606"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: efficient bitscan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db7d8a8e87070ed09086bc7c1b961eff5dfb68b44f8ffb56767bac9a96ec260"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: efficient bitscan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be45d11f1d78842720e550bff82b6fa2fe168759d3f01e3fbf63edcb239aef1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: efficient bitscan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"170b36f990e25404f12aa760bc71a081a8b14b215124d77bf4b748d97d1c73a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: efficient bitscan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/cum_agg.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5240c2b7bddc077272fbee99d28efac601f8b33d5f7c3b36716c640216b562"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle overflow for UInt64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/duration.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd5f846299e6bce98ec48c360bc5d19c4a3be7fad047564466cee0cfa9f393d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO supports fast path. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/is_last_distinct.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a57f8094c801d54206846a32acc9008d3b6a535ef4f4b4aab0390a28f71420"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! change this to other join types once they support chunked-id 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":"crates/polars-ops/src/frame/join/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab974be97a0073b1e1da75e1565a59cd06b178d1d3834f77987fcaad085979e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should compute the number of threads / partition size we\u0027ll use. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda8f89fc5b8618f6da30ba27a0a3f9de535a1814156a6ef80d1d68a606e498b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change interface to split the input here, instead of taking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a937b19a992dd524bc334b9dc3ded0dd36dcb6e12a4f46c0a3cd2329426a456f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we wouldn\u0027t need this if we changed our interface to split the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e88c797f3a55c71c6ae47c55b862e0a0dc37438bb386fe072ecd445d9ee00"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to ensure we never hit this branch again. \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":"crates/polars-ops/src/frame/join/hash_join/single_keys.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c15face2a487dc2325d662cb278742dbe2e15fa09b87483d9b60cd20d6bf96d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: @scalar-opt. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/groups.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e6f9de1dfe3d8879ac5e1cb2c1f6f946c498c27843ebc1ff53c684ddd6517a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a lot of heap allocations here. Improve json path by adding a take? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/json_path.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"483582e8b75dd2c02a72402da5f8e2abe30630b3335ea345f7841bb246c92ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a lot of heap allocations here. Improve json path by adding a take? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/json_path.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb2a85a29cfa65853eb74326130eb46a0d8a105120e018285e8b886b3ba1706"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! below should also work on only views \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/substring.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ce4cf7e0f07edd7e2180de930e3754380e0c72f73518e0db16c61b822ea3f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! below should also work on only views \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/substring.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa154ae2c2f5bf1a7babebff8ca9c5d3fcacfca82aa91dd01741a71ad01495f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t loop over all contexts here, keep track of good ones and inspect those plus a couple random ones. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8d034212c7810133e4e98fed553e87493211d01cb08b1e15d9a5b362c1cbc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t loop over all contexts here, keep track of good ones and inspect those plus a couple random ones. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be28380fb89f2e042f89e26f1b76813a77c00351b73daf1bd2fc9d73653bfae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t block here under a certain memory threshold. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ooc/src/memory_manager.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad78e7eec00999455ed4f2b49f6ff2344a74a12c8bd008c52243589cf2759a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: starting score based on 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":"crates/polars-ooc/src/spill_context/stats.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9814e42ac730692413bf8a8266bbaa6a2c3aeed84ca921beb719ba53b58e8b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo! remove the force option. It can deadlock. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/planner/lp.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574fdf5ee5a18f0166a8586fbfb978e961f723a428ec9a1a6ecdb847af47962"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! optimize this, we can prevent an agg_first aggregation upstream \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/group_by_dynamic.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"66af86c486d3174d473d5233c285191ae52c6a8aa10009c42d8ecde0f4229362"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also check the 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":"crates/polars-mem-engine/src/executors/projection.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"920cdb4ad0ac8e15f5b370aabaccd9fda43c3b812f46d108b7523743d2e48c7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO!: don\u0027t read the file 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":"crates/polars-mem-engine/src/executors/union.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f93538ade9645768d74aa3aa79c47953af50dfe1531cde41af01d997a3c3ab1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is only the case if we don\u0027t create new 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":"crates/polars-mem-engine/src/executors/scan/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c6ca2770c77c94ec931b84ce325b2bc2b70127398275a762955995de07baab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! fix this we must get a token that prevents resetting the string cache until the plan has \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/tests/arity.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3433b7192896a160e1a7e8ddb7167588e09b85e3583b7d5f4e788077d19704"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Path expansion should happen when converting to the IR \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/scan/csv.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"53415e63541d6e1bb2970d18dd60aa48c59de47be3dce59bbf2bee55bc56a38c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! should this error if \u0060existing\u0060 and \u0060new\u0060 have different lengths? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/frame/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2b08c4c43974308f892c60f2557580a84ea5f262d468c240c67a50a9534360"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should just remove this and use Buffer. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/mmap.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c25aea92f41601eba1d7881e34351731c7d70cef6bd5b822afab91d9f82e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Posix_fadv should follow the access-pattern, which varies \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/byte_source.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaffc98d37d9a2c9c5ccff216fb523906799900bf193d9ffc2264251d862155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO document precise contract. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/file.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed2e98844000771a93250b3765c821ed640c3c6626acfbf4ffb1d5c19aa39dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also probe on musl (needs our own \u0060struct statx\u0060, #29306); musl uses sysfs meanwhile."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/utils/byte_source/dio_align.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0791e41c3f64ff5690c2377b25f001611a56b86cfcd833ac854744b21e6b8418"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add an ArrowDtype eq wrapper? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/parquet/read/utils.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6527e703accc5795a861cfc8ab7e2a6f980ff847793b75bd41d9a4cb057f9f8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! Ensure we don\u0027t materialize the columns we don\u0027t need \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/json/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5391b058d8fa1fb36e06e2bba1edac80f60102c5248ae539b6f985d6e547ee98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! hoist to lazy 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":"crates/polars-io/src/ipc/ipc_file.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8473f1471a3f38d7b25f03a0cc4f2883b5eb89b120ec521bb2be9a888ea5ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only download what is needed rather than the entire file by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ipc/ipc_reader_async.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5081aedf8a9888059458140f267232f2f49ab225e393d0b157a0e889dd717f2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only download what is needed rather than the entire file by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ipc/ipc_reader_async.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dc3389807ee2d0b6dfd81915a125667137519e2556ecb6658053dfc35d59fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move to polars-arrow and deduplicate parsing of footer metadata in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/ipc/ipc_reader_async.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b6b42086e7d5a270d36e605e4704927b579b81653345c83a6a0e81abb34b31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! do this without allocating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/builder.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"230845ca49f30c9f707f2a265c566b44f50550e291ad20a3d309e3027cfaefb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement streaming chunk 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":"crates/polars-io/src/csv/read/parser.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c4806cda63bbb03ff7f78dfb0a7d14f09d7be98a7ad3cf2cc8c09a51b459b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u0060reader_bytes\u0060. TODO use \u0060scan_csv\u0060 to implement \u0060read_csv\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"710f6c4bbc63da7283e1263684593d51ed602d65a46417d414b15c9277ed2fef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We currently always override with the projected dtype, but this may cause issues e.g. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa1aa76ddb07011c68d046a3c68e000d09b850467c90ac498a1b70ee7e93ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For now - keep as Legacy. Switch to Unbounded in a future PR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency_config.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936aa6eafbcaac81d04aeed8b6790aa8c9ac7231ffbc06d00fb98d12360a99c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Dynamically size based on CloudRetryConfig and Init/Floor values. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/http_rate_limit.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b2c6da1b95879951c721415a4c3a47ea053752fd0aa057739cdf255f3c8b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow shadowing of existing schemes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/object_store_setup.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5d97b572ac195fc3deac9ad68160c09e426e26a8c0f0a47d178fc1002f9ea6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor for updated concurrency 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":"crates/polars-io/src/cloud/polars_object_store.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f8a0d01dd6b6bfdd101bec8d5e54e4beb99b51937bbee619811778f8dab103"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace the legacy concurrency_budget call and switch to BytesBased inflight \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/polars_object_store.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eed7c118c8ba9b03f890c05a69e4f2957fb644a7b06c01d21a00ec4e2a7934f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: no Drain phase (BBR): leaving RampUp drops the budget to the knee at once, and the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/knee.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd8619e9f7dc2689f4a43d7c0db12dd9253f61ab20b7f4a6517709e06556625"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Factor out as we only care about per-tick_window 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":"crates/polars-io/src/cloud/concurrency/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c61385b708400b8abf6c2c098c1fac48724b1300e4fee7535a9472860121ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Introduce \u0027tick buckets\u0027 and move to ring-buffer of bucket-based 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":"crates/polars-io/src/cloud/concurrency/model.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d94c1520cb8732ae52dd9843ac512eedbe94f8ef01d80c0ebde2e2dae1fdcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve accuracy by spreading arrival volume over ttlb-ttfb duration. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/model.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe782345150d06c7f1d97985604525c86476862b1f2d2f2dd7678c1ce594bfb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Some form of HWM expiration or decay would be 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":"crates/polars-io/src/cloud/concurrency/model.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce1b1f4b5a2d6ece7f1a684bbf2ab139994ce322ec0a11230835d103da84c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add sensing-based app-limited state (see BBR paper). This state avoids model regression in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/regime.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c0e6cd1de405710d1ca85ab66f5735d53903c5dd439fb0dc761e19ab09d633"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a ProbeDown state if needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/cloud/concurrency/regime.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd6e7a37c56598d7c05210f5234cf856f4091933d0f0a97120fa8b8ada4b7e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more efficient encoding for 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":"crates/polars-expr/src/hash_keys.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"857e1b226b0612a470dcfde88b0179b7238af84be2399e2813d1fa71e25db5f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use vechash? Not supported yet 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":"crates/polars-expr/src/hash_keys.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"df473984902f93c40473cf3fdc250f85118a831574b90a330caf54cdf3bb3935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: formalize as a \u0060FunctionFlags\u0060 bit. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/planner.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b1a34448b75406a5492a7186f7b9b6b60c249127ab9ee4b7b505d06a278bff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/approx_n_unique.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b5f512f8864df9780f080d20acd667b6fbd439d125d51cedaea7d285a152c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mean.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016b83e779e60d576d625b352781c8b5ac9253d784a33df5124f1420690c4d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94fc172783af2cc428b9d5875b81176fdf7c1b4d478507fab374fa218a3ba6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c1890e201022299907ed52ca1da64d3561661614a49dbabcdd793cf725aecc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0ccc7b4544e447c7b5340fa442c2d7be3ab8554faabad72538d95de1b0a9cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1e88e2003341a25caf2aa6a6ff27c7dd83839b52ad9bf143718cdbefeb1429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/sum.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6114304c56513ffdf48603dc0100000e1a6170bf59a0ad4c1700f29ce4af6364"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move the error checks up and make this function infallible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/var_std.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a29eddc2e699851d8cc12b0ea72b2a6c38684ee33b7020f92b3ee94283fc14b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate SmallVec\u003Cu8\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":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"508f9f25fa5954868f9fc835838a2d1068458bd83e01a35993a11d7adeef04ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate SmallVec\u003Cu8\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":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f519e2333b7013c208d0bccbc744f110f19c4a43603dd3a1ff603883a4c1dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should really implement a sum-as-other-type operation 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":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d329c912af1083be9d9727e7e524ac427d512bdaa3196d337da38c9a1394a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should really implement a sum-as-other-type operation 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":"crates/polars-expr/src/reduce/min_max.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"707b0ee4cc48936f905dd759083d3903ff49fb0a2d03abc34b4baaa6f78d76bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: @scalar-opt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc211f925cbbd65c1c2fcc8f14f98d937724b4d1dc3d5bc7bda880aacff17d7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ minmax-by: better way to combine payload and mask. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/min_max_by.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b32b9b74b223e69f2f23f900e4ef1daa4fb85fd59f0d34f3b0616f471a5816"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Introduce \u0060UpdateGroups::WithUnitLen\u0060 as a new lazy \u0060groups()\u0060 method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/aggregation.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa69dd9507905c0b2ffa9dc25d04645d2d4b6d62988c36886ee6046da4092fca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support Idx GroupsType. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3de2c4032a9098791edc2fff432aa13f6bf099bd51c971d73d1b5e6fa084af7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize this/and write somewhere else. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/count.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f816ffc821960a22b4dca70a26d370fc166570628a230ff60a7d91cc4e60208"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO! support keys? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/rolling.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad4903d9e181382e492811481daa9acb3ad0149ac4ffae10d9bb6a3aedb9e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When \u0060input\u0060 (ac) is a LiteralValue, and \u0060offset\u0060 or \u0060length\u0060 is not a LiteralScalar, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/slice.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b94aa9c9fc5294023bdc52d883329afbd4911c3a2eab2381ad69a63caa53a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fully understand the rationale is 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":"crates/polars-expr/src/expressions/window.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf9ecc887581ba297e850b04f6532902a0dbc029100a59f7e52cf069db03cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dedicated 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":"crates/polars-expr/src/dispatch/groups_dispatch.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e575dde47553db16baba8db6ffc5562f657dc8663e5a6c793fdb5b001f3f33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! don\u0027t auto cast here, but implode beforehand. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/list.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c836c5601f1b977cd55d2477fbabc25c3f4a3570110c1ad68cf2a57b8052e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0971c731cc6f08b7672a33b53856a4406c51c7d395b94842af416684a61e584e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e826ccbbbdee388c11c3909e38468cc4834e6ffb0e490657d95fbac718fe3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1752f2dce5db011c80c4cadb44f4d4f064f56141e80c6e0ebf255b5ee28412"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! num_samples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"723bafbdbc22ab2472526d343d0d21be03ad5ca5ee300b38b58c634d4f94b76f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UTC with months == 0 can also have a fast path here, but checking for it 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":"crates/polars-defs/src/time/duration.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5db6502a4a750d2c5b2f9c1f90c6bbe733339cbc598fb3379918ab30bf200e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! replace with lazy only? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/functions.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de29741c66073a48bacf98a5b330e9f3cea15c32415ee6fe4795db938344a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if the chunk is much smaller than chunk size, we should try to merge it with the next 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":"crates/polars-core/src/utils/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"989ed9b40b104f9cda3330d51d31425aaaaa3218994a77e8d38c83e2fdc46f85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! next breaking go to true smallest. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9a75e70ef65270e15163fb5844f6ae63f7d0f52fe248118e73afb7740c6480"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! next breaking go to true smallest. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/utils/supertype.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c92ceae67b585a31d2e0b825dfb377241953ee51481a8d76e4c395b7ec51bce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get rid of this hack. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/builder.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30d631b8b63e4d3d91f49db3e626c202fb0c500d4de5977160b1dd0d67b9b06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/from.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487de56a98465c1363b34dd8fb337e3955addcf7d080165a2a4a1a810e9e629"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! this probably can now be removed, now we don\u0027t have special case for structs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47aa3b10d88df2c62683ec96713244ccae2cf800ef9e25b0d8cc4169d929e11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: include mapping size 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":"crates/polars-core/src/series/mod.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46a8b9d94bff3086967035b59eec33a3274939dc1cd2f5bf66ede53bf502105"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this somewhere else? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/ops/reshape.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"36961c0618a3bcb332bef94e8454ef819198e18e4d21bf750536253727f22156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! add object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/binary.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cf68b7e9f50ddfb7d97626ace49499f8036c2bed467225c7cc3909e3e480d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! add object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/binary_offset.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c73483f7758d49166fa0d15fc13f25715fa674b6858bd2324557a2702e169"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! add object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/string.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2a7e9659aba7ebcbe3acd38fdf0f43662211666f5940ffd1455e40363d7879"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! add object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/string.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b25daf74813a4c160047ebc8073d66dbcd94121799c8452f9c1a8e43a9be701"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t use row-encoding 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":"crates/polars-core/src/series/implementations/struct_.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca73ce5c0fd35915af9e3c3f5202accc973fb0ed2a51f65e16e9ebeaa783345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t use row-encoding 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":"crates/polars-core/src/series/implementations/struct_.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bbbcfa77c20691b7ce58aedb30d31e829ff3c6b55c90aeb5a9d010b1155f5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! try row encoding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/struct_.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb64f16d6219061fb59089affeb46cf513f63e3994a8c0bfa7b3df4ecc4aa31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this, temporary band-aid. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/arithmetic/borrowed.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eacf62f8a5b48329d52c86e1d303c09e740c63dc2d8a2b741f9638fca67a7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/schema/iceberg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb1cf04fbba54e5ae96a46590ee05151b2b3abce3593764da440dc597658177"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! change to something sensible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/frame/group_by/into_groups.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd40acf6e23cd540c052966e3ad88ef021fed6d1b25abaa4ead199cd594bcec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: why can we not cast to Binary? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/dtype.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"65342a0d865c350d0c769c0bd967af4597f99f4e4247d4b9ce68a54db765d107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: remove after exposing to/from physical functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2570549917cbbc9767fc062267dbae66bde915f6113dd5d06608282e69c97bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: remove after exposing to/from physical functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"31613aca62fa85b34334ef7777cb47b6a4f667fb2ae9b9fe33c3b3ed88f06c8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: can we implement this 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":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"3376632bfed45d32c64181f84efc73f419c6d3f7ddaa51518cea3043052104da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: can we implement this 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":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f795d894de3bff8b17624e6a21b601122725febf8efd7cd5012868950059d27a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO!: consider a version that works on chunks and merges the data-types and 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":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"11226973d81315c58479b1b4ccdf8c1ee76e4a543d9acec2c9d5b5ab14820e42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! add chunked, but this must correct for list offsets. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7f8307a9728dfeb95067f0e89fa65f9804d39820b9e59bd2e454810e6c76e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: eliminate this FromIterator implementation entirely. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/from_iterator.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3018bb02b40ae3d5d243807dcd9cb87c5d54bc4a50f4e650bbf4c8d228e2a4c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // 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":"crates/polars-core/src/chunked_array/from_iterator.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"130e2a0992d7f3142330b86e0c6ad1a1487fbadd840f550728aca018e6dd212f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Placeholder for the NoNull helpers, future PR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/from_iterator_par.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34846b21d1021cdf9ddc0bb4c21dd39ea4b53b4cbc52921b2860e646671106e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid extra potential copy by vendoring rand::seq::index::sample, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/random.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1943d41b43abbec19146430e5e8d08c360a515d105eb49efc632e4ce5f04d935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! this will try all patterns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/infer.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d7481cef587d206dcc2c131205ae699c5eff7c261520e11a190988aecada9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! this will try all patterns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/infer.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d664c313a5c40a49e1480963394083b93dd83b7e9d3a75ea79eec7799d1d5f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this seem strange to me. We should use outer mutability to determine this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/struct_/mod.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1077ec85a1c037b3d7a84d51fa6faef0ed8b97d7f20a64b9d9bba4b1ae83feda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo! use iterators once implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/chunkops.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3c2ba9e653270e10bded11b68931b79db02dc4c0f0909c033f3a0b113d7d4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! properly implement mutation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/extend.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2eb4815c8493a7efb08c39aead3f37d8596223fdcc3f48bdb4685d0f841687"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! properly implement mutation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/extend.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad95bdca826311f384c21b2e02b8836a0ac103c97071f460f443fda3794946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! properly implement mutation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/extend.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb23cb6436fbfe2f9643902eee401a0ebda3f9ab5a9e0c4c40f5b34bf182e274"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: maybe there is some more efficient method, comparable to select_nth_unstable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_bottom_k.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6421009db341ee1f9b1bc791ab4cb711f933d98502deeae1f575f0d1b5f0640"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: possible multi threaded \u0060select_nth_unstable\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/arg_bottom_k.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bb6305b9d608db19f646c7df47867d29049641573bd6d7b14bfc5d144e462c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can optimize here and just put the null at the correct place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"237297feb8927e85b632bf085c34dd64849f90701041ac1770ada8e45a3a3080"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can optimize here and just put the null at the correct place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c21bf1a05fcb07a45de42c66fe31081ff21ae5a470adcf44a90da4648cd48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework:, if len \u003E= mapping.upper_bound(), cast categories to ViewArray, then construct array of Views. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/logical/categorical.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad0591f50e25826f4a2750a836fe4c56d69290667276f2d3a636ef79163555c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: if len \u003E= self.mapping().upper_bound(), remap categories then index into array. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/logical/categorical.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"39455e86e3e40fadb0346b68dc2281274c95c43aa37829f83ec9d5286b0d632f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @ cat-rework: if len \u003E= self.mapping().upper_bound(), remap categories then index into array. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/logical/categorical.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3bf537ee45f16803aa01bc04f9d75ba1ae1705a9387292a736c1b047ad23d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to deal with physical/logical distinction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/list/iterator.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"91245a0e348090b09103721014e5838cde4eb5c25aa027bb8c35570e98658d3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to deal with physical/logical distinction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"83396319c161b898f885dc5e46d48e3327b7feddd71d12647ea5b5189b19bfca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! make an amortized iter that does not flatten \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/list/iterator.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"88985e3cf800975c7de1574ca3d5286dc7b8c666a2f982874ac442750f77ed09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! make an amortized iter that does not flatten \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/list/iterator.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"82439463f43235e99e6cfeb9a311b3bb666627b6ec1f0a40904142b118543ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more strict instead of casting. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arithmetic/numeric.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aba1aa6a547f8b29e47e725bf5b4ac494a70aa1837c88d4c8dee520b483d0aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this with true division. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/arithmetic/numeric.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6b7617f795fbd520f6becc9d035e3d91e0ddd5321dc1dc867a0ae03f7a535c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove 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":"crates/polars-core/src/chunked_array/arithmetic/numeric.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223ea6fd3cc10a68f81762ed61eb9e8dc67c0280780626b76d0f03826af163c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove 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":"crates/polars-compute/src/arithmetic/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d795ef082681c93af0ac88b9472aa9979de296998897cbd0886ffd141f29b6ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Turn DEFAULT_WARN_UNKNOWN_CONFIG on once we support all stable config 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":"crates/polars-config/src/lib.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17b2dc200acf48512bd2d4b8aa76c9cc961dfcf2746412d6829299e362f2858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This exists because \u0060POLARS_TEMP_DIR_BASE_PATH\u0060 in polars-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":"crates/polars-config/src/spill_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbe6871a0332699d8c6917f11bb86c8aacd759296c76bf2a9dfa8c55095847e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more optimized implementation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2df56d4ab56b2abdba648a67d7fcd72abe9e6cf7825d344ec25ae79420030bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: correctly rounded result. This rounds multiple times. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/decimal.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f332f7aa44c92b02ebec5fc4d3933c46bd70b8545c7f53408da5f62ceffadd40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: faster remainder. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/float_sum.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3282a9d6d4e83f3fd376cc0d23fa9800f76b2fd1fff27516436e2dbf89de5106"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: faster remainder. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/float_sum.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d98854f6cac60b9cfdfbe6dec218649529f8f68d48fb7a507b01efafc7a2b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: faster remainder. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/sum.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ba752b0ab745c26cbbf34abbe4bd3e2da96a719a1be9c4543ec3e72453ac4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could theoretically be faster by computing these two filters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/filter/boolean.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c440e2d63fd8485a0c275cacc63bcfe15be5dedab3effc87bc5753ea2a9b29e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this function is intended to allow exclusive conversion back to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-buffer/src/storage.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adec628d3e666eb60430b60b1d494e8cf2d56fe3b1ebb9c529f2a284e9a943e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: maybe refactor this into serde/json? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars/tests/it/io/parquet/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b538ca0b8aadebe7f67c938ed228874385b09a728c96f9609328ae2f2a123e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: pay this small debt (loop?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars/tests/it/io/parquet/write/binary.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9280d4833b323e6feca70d7ae1f59a9d0c060b795dc2e7f4bb195a6dee8d7c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: pay this small debt (loop?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars/tests/it/io/parquet/write/primitive.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4fdeb275ba77805063255ae828e6eaefdb6ff887c467550e756558c7f3b85e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: generalize i64 -\u003E T \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars/tests/it/io/parquet/read/primitive_nested.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e368533187d4012fc759853da84ed826ff1b8edb099b44f3075b0ab3aa7b197"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! undo miri ignore once issue is fixed in miri \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars/tests/it/arrow/bitmap/mutable.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313e30c532587f02298a39243459d7f289bd2c87482134b032f9b08a51d9112"}},{"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 \u0060crates/polars-plan/src/bin/dsl-schema.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/bin/dsl-schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d04d53a81b3099eff251fa566da61c1665ca2a802cf0101a34a8f890e18839"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 11 of 43 project(s) overshoot their size bounds, lowering Project Cohesion to 4.9/10. The most over is \u0060py-polars\u0060 (111978 LoC, 407 module-visible types across 44 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34fbb712a4f75b1bea9a8f5d5712a2d6432a8055832b346350b1dbfc419b996f"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"4d8c52268d030c58e76f44b076a2d26a27217fbec28140dd6e162d00d2bb0179"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73b273975b8ab56762cfcf8b0a6e7ae632126223c08ee551d119c9e07f1107df"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3444875eb99197b431368f95940ab0ebe13b56e981e2050fe37c6ba9c0f6fcc"},"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":"e32571dfffc1256f98e332ccbbc144f856cf290aee945bbf9b93868eeefe8ec4"},"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":"6d4360894b2964cff7de98994c81d1616a1a419dab3a5af503a4f01f2d7cdec8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27005f5132673ffe42cc164d827cb573f6931fb1fa954b8f89c304225f70a203"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99b892dc09b4171aef1e43f5c3f9bd65d197f4672458c012ec865695727c1528"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1be772ed8d177e3e6c32c25f756e717fb98f84ef9bc5310b6ff33f6e1dde5be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bd330cda210f6306e61cdbc9b7db3a83a9e2d0e197273006bdb07fd158889ee"},"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":"a37ac2c032e07f026b856ba20d13556d0ae99eecd68f8e8746d698c94cacf3f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d6777bf0a5708d4ed28d3c1327174ddd6151b82b0fd5837e58d413205fd8ff2"},"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":"b61047cc149540adf43a579f44ba0e3a3cc8ae8ccef31db6beace7898d73761f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61dcd0ab20086db341d6c3d184b3dc8a4f5422da1885024b867830276ecddbd9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c661132310e1e13f0b095fd5d6a4be7482eeb3e70748128c70f2998a2761b7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e3729e8dcb5da9ac2a88ea5403cccc736a8c4d74bc1b430d0be2689905ff61c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e469601daca5eddcd3bded70149e33de9db5e9619acb1da385648df8e764aa9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b71ede8f7f4f822b0717217549d52ed2d641a6b93d9d3e7475879114ba922ee9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1274edead2e997337fbe22bc1fa8d30b734bcdbed89a9d1c1d2a0425d5b0a540"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f80a5e4fae6eebe02cd70c762c92ecb0eff3e50c8f8fa3b699b3c15be2b88703"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc2f5e6f583e28e934d712311f05ec890b3930bdb1507e160d82e8bdf7b10195"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"388280a2105d5f3b8ed276b4e2849b0ba6abb18952c80cc1be4ec84b73f64d15"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cd73061f2025cace9258ded9c099bb6e5726345bcfcd6ac54371e4b5396f1d5"},"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":"9576eff4c8d7578b0752639defde40195776fb116a402e732b474a4c1451a953"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91086117dfc9cf22df7ab245db529799d25b62881149778c2f9728bfaa99af9e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f6e1d3e71ee7d100a459c0f4083afbf50070565964f8a90a4588735514f8217"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca3ce2006b2c17e68c8b4f7a21d09ef892404c2af4e6baa18332f29e57097468"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f2eb0be78c21d4cbf91d61547d3abc14a1e4f95c1b783cf51fe088fabb3eebe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50219ff58f466aa3dc4aad3d279de9ae4e0d62f70eafce7084e38a6f4dfcc83c"},"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":"045ff62dfeb118ce40075aa89a745a441f5ccc213f1d5908e92f3561fbb1e4e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de50cc73c77831393f9ba34d581b635c1944e8ef963492ae9744057a9ef37824"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f57cb6482a78c06cc8ad234f2b1741230a6daf75fc31ae51b32c4b5bbe7343cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a060bfcdf5e2abc550a8e786f5911b825764d653f498600cea5f3a8a146808d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7312f8e6c1f9fcddd24100f1896cd527ecd48232cfe4cdbb54a0cf63a179e722"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fea899065ccf8e353c67278c6a08f5268634efb6ed6555fec142e64aa50dcbe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70a66f1af71592d1e28bbae544a0eca9598e88cdb55a10fc8d4d88d213a55cd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"505c70fe2ffb727ba635d1c768767e5135bbc417ff55ffc772648ac1cfc3f422"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b734d160958bedb91a815fd99956118dd2762f4749598c5d231f4aa78a60f658"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38665399d6ca0d8e09e3dadfc4a8e3b3dbf8fc74545d71997d7b6949db8eb18f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15ef8586ea3a96cfa4ea647cb07cc70fd9ac9837956748cbf6d32399969967e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ee7c95d368077bcd895eaab1248207cdf95725f537fe87c3225d7ce15cca1c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c65a610d9b257fb41e81a2d35b17d693bd48cb567297e9b6449d5774c53d7d5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6f8c4248e7f020d6834e22442e448dc8b109ecac437f04339d5de7b68cda1c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f0cfcb85dbcf19ab74d0e1883a645788a31f7fb0fdc6e2ac42cb2797aef893c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8540f4c7ef98e05beb7f15846882bc696e678ed7c82b9ab91d8bc1a87e9ce6c"},"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":"f8acbf0cf6552a23bffaf5478ff4513b226ddbddb6f53de9c432a3a89a941c3f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48729e8f0013c716b45765c756975e73aa898c6b7a00c7d6d6e7bbbe1e3ba852"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"547d4f10b3ffd37f87993535766b14412afe088c0726fe63a75a9631e845c41d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b583a9d91a14abf1b286d18b90bfe3e9cf6703aa9d82da1a5bf10a1c5892292c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd0c0785cc7c042eb837b5beba6a1aa637ed1975b87d52f0dfadf5f04a52c289"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4034d2ddad0fc51a4984a609e5a7f2cdb5ea10b733c6cf49b21d9f5f56db26ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71048402616f398c9cf85a3b99bccc8b2ec8c3fdf6ea156128c15c1d34923e83"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79abce4d42f00b6b188f82cb5c56f1912e1d9adac250f18ea01b729154ec11de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d7d38e775f43648e0b8b66c248f75194999634a3b23464c0ee891ccd64457e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23a06282ed3c434733c28da0e41b45d5af61fbce77ebe76eeb1b420b6a57f5b4"},"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":"ec2e6e006a1380e8fcc42373159d94ca84847f0836acdf2f8353c2d3c7484fde"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4ac1e50888dcf4262262bf543a3412ca02b3100d8e84d0c15ee62a75add934a"},"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":"31eddb2f94f9c9977f652ada0e97bb95f7a096c0d2cf505e4554609563e992cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30a3cf09eb12d04a795c2a2e21f0e9020229908c4793071d51ae515d2344cc08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e37bbe5eaa914addcb521b94b6305ba14a333c7a4645e1e00c6823fba474687e"},"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":"5c1b27f444ee9d48ae76463cfd1bb763c2d0286df94968144ab53792bf5c9449"},"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":"dd570ac9169ec83fd19d3918fcf0ad4669d4a403a9a3c4710b05183f7c53769e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd7ebd8eea6873c2ce7f6f0e4b75806ed89760b5c2831810d528fcb1a20bc68f"},"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":"443694087f8dfdc316c127b8e31d35e1337fbc6ba1fb99fecac7c3896c487521"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"addfc9b3fb4e514fbc1b36a472619df11fd04a08f82084d9027a1ebecff19aa9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08d53ecc9d06f6d74894e3ffde53954e4a8a44a3fc5c95b4230854feee185790"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"247adadf37b673fd5c2f8eb5e5952103e21b6464126d380b8923bfafb259f475"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c944fb0d793139f172bb9507b556f09ab14abafa419435b305b2aa2ef96e6f5b"},"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":"5140a97bf492a92772a11e4ec170684a77070456ea8ca8355178a42324778e59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20dfb248bd5314304af5930a491a386720ecb74cb523c97fa6dbfd8c881a8046"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bde12f47c11d31a79d040714c0a3279a3403c00145fae8f0a2366ebe85551145"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0035e58d1878e7746a0dfc42324da8f75a04d9e1094316f92930b54fc540e7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40eb70ea75ba735f3f4eb0261ca6f8d7f3d69351ab34a5bd0676c8ec26d76055"},"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":"66b66f04b5e786b3c78edeccfbf9dca7751aed898839994f507bc7dac6f57049"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cd602a98d1be5a85cb359c441c17ae39515a16db4860db8107db086c95d6233"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e3c3de015041e160132dcead578d109d1bad3ebb526be0c3ef9bb5d2acdb407"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c22755e7ba13432c47de06d247ea06e7a6284b197007a915cbc6bc1571c434ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"717c52573b29d9dd04da69576869ed79058d2454f95f46df55420125d102cc68"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95a192db8889e21371945f0ecabd3955878bdefb3504ddf48d0dbf1b5a11dd9f"},"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":"2e942d0e5d6363b30e1f147119b81c83b50b16fd7a7b5f1295323bb1371e623a"},"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":"d8d43e8f931c33d5d6162749e6b1e6267534aaa747a838d080d92c2bb9208055"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"924c2d13ca7fd2b4129dbf95429d150bd11c7ff8602200beae15ca402d38177c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36c430b7455d0328d75759fe89c6d195729587c8ec567c033f2b039f3fb16315"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d865ed7f902008e52f99c03fa34b0996bcef9e279aa1c164a12a028dc216a1b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0f36b87b6eee7148c946c93912a63351edf6c45ae4550e62f36f414526b6968"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fc2b5659387fa2e4c01e8a57e638b87480f83797b60ad67f51382f9c3971f11"},"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":"759a321db5526941df0b9b1dfa052eb6b42832f3933c7187e01cd533c3b42a88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9364f313817d7101db6774d4ae7c437f5570619e82b9c5af0b294b8b2eada1ba"},"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":"c06051938303e391f30117e18cef052254cb7f1e6f04305495c5e2eaa060d9a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13d30ad0dffe63e8e1ce28cab774cddfa7b4d8de0bb42a2d0191c596cd47bf7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c1935220d315a99ea6a5c6c94392458a413c805892ce332e02c57309e479249"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"094d8a7ca9cccd790e08320ad9e6215a06165db90c8a0c9b40bf89f229849b64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"833c460bc608d58c54c0ec00bf907e959ed3542d2f7774e8e9f467ce84a8d891"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aefa3776d4d04fc6f7e86ea0461a60b73a56c30f008c0d436c1ee0cbae2af1d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68a3398ddaac1304fc3aa77f9f9ff442ae4ce04b798e6d5c30ce9f3d63b37f15"},"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":"51694dcadcb1484003c3b621ae18134d747d5c49405cfc2349fcebe88f653f0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4900f0eeaa8cbd5de11f076308dff12748b26774ce39941cebbe164e928ce7af"},"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":"20640f19c361b83b4a14f85587f4ef9dee39779d1ce357e34f75930921bd3a90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f57f912740c29eaf2098da84f6ffdd807ed4c8c3968347cd288b9f14ffcb10c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d70e0b5b9e728452b63bb08051bac5f274f5b6685a0dd05040e484e45ed528c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"368fbe52225d44054bdef011a8e8ca860283ca5d928835dcd254b204c0e7e31d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac9b6fbad98761e1147e7b4dfa57763e4b3814fb377e1f8f8f77d49052fb2a02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99a7af5f0c7d190561b97baaecb7f68a770c17ddd9b51c30589e3ecae5ed34b1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae40e0a183df80d5dc91dadf0f98b8fb53348980981ea420dd8271b894c7bd62"},"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":"0cf36ca1cc6b11af431b9968d7471be5d3faa91d35a5ab520500494c139fd833"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3154ba7b4714ae9548f163e1c980abfc9ec99fd308acbe47f784523be5d5956"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5552c53995100d72156546ff80882c747fafbe8dc61eca74ae15853f1bff2411"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1aa777a8ac7c7d92560b08562b2d23456856167999561f93ac9f9acaf963d7a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"758d35ee328724bad314c5e47f5c9ab636d7299e756b4aeacd0b2f63c8c23ed7"},"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":"aaa929b42ae7b42335c04447bf3704004c28a39de4c2e4dfe02d546dd6b1d66c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d227225636939cb7ea3d6fea8b29e3966bd3271390a1f3bba1dd4248be1a3eea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17ef346cc55849200d7d069719b532befee72a0b5a3069900dc5494da38baed4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50441ef4ed96b1dda49a6a0fd5c02d58888aec3b0548a835595d3ad89e81a66e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2effd1076bf18e4c54e095c131a2a7931a747c35ab954b84d8859816a862e09a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbf6d88d804f356ea389739d36496e4bb6bdfd8bd80984d001c554b7f043f391"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36cb90d0f578edb0150811e9e504ad6923986d3e81be1759b525ab4d44f670b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdce5211f328004ae4dc9f5e9f12f90eed26a579de25295d19a781a363c1040d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11713b5be13a86073d44a8cc818caa7b9f49fd4710efd197fdf6585eeda6b2d0"},"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":"e5b681f38a05b49cf2817af1c930baff0b713b9100187b042708bbddac780f8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af88ff729f70b3904a2bda1c3f5f6cc3056b19d511b31ece92aea8320493b582"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ca1c73c6533adb658da87d66cc2fe603bb5b05af39655f23fcb8f8f731d50b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dfaf5e977054be3b3ecb34655ed238679c1c7d306fb5517b02339ff1f7f5e3d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9321865eaf2555d901289b875d12472fc5c211e88d39f8571397d660823dd274"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6865a4ea2c5eaaff4368193f8faa769fc573ee438933819946533b110acd436f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1091be46acd2a7ccfef2fd90d156acffe817fe3190ad48f5148eb11279d0f21"},"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":"ccb199ed5733ab543d40d9cf6dff089f82414e571a676a30df211e83d2287619"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e77e6e0a3944924617521a0b0eb9fa5429016efd923caa5a4ba244409a1db2a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af2506c56969489e3122145cda8c2188d99484195319eebb4fe01f8b7f9ebb59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a03bfe25628d0c061dcc25d117d64e8076555a06bc2e348228006ada7071b47"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd9bb47feeca9d4d299d4743373b315eb94a31ca3404cae2e9c1535055a9a72b"},"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":"69a9bf520c531559f6d3c417471a14a9f7230a15412da3992ff27f7e262ae682"},"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":"42036b4e9e74d72eb2af81c8d1fafe957b4437a0a2d2159b80ec8b71adcbda39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baa696caa745081e8d3a0e9befa5b6eaa8fdb35770a699f1eec2f1f4b71109cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73d40e62145d102985bc6e57c0f209c8e437e2e1a5516f48efa48ed1fa3b99fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4641237f08e13d4ff13e54514ae70af6a0d6b0f4c2adb41d6b0aa118184fa2d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46b84344f4818c438b6399ac1f7c600ade7538901cab7c28f1f576897b5cb221"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"799452f6a068028ba1ec4f99be2bc475f12d7cc0b66b6892be06b3b1ff10412c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"692669a6d0c0716703437c04be204d2caef4c5c8f411912912d66c8168405e6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44875f1ec8dd0bfc6b12e581a4509537c9c2dc1e91dcaed383bdd076323be71b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eee6eeaee1d1819c08918a6604707ee959e3b6e705305849a41371a1353d91dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85b812f1ce2bd74bf68ca0bf9f36340daa39bea47810c5835a2d6bf003403f1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bea23d43bc1f3a721aecad7aa698385ad7da554aff6be7563089f41b463ae16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d435ae0f809057f2de6fa60ff125b66c0f2e8777a7266182b68a0ccc94530829"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c3fb7a06a456755de50810b26d627d1250ee2a637ab797662dc78d7318ed0ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f78f851481821e273ee1266b7d10f5f4fc341b96c958ef51ac42c9e96832c17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65156cc1b136d48eb5c2c0a02079c5190a47921e32f5225d6bbe2b193a205f5b"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c341f3db88a6459bacd6b3be527e81520f0197c2f97698e3298689b512107474"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d8246d072f01c332698350701180987f39aa7a46a2a61e4330b1d77c35d596f"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8eb4edf70ccecadb63e800aea2c028ca3ef43ea0262e720b01fc7273c91d84e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4668f097227cf4f26e3aa6f766064f9ee7286432fdbd5773c7bf2e906d48da0f"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"698e6a02465411d28dbc56ccd3e699de43b2c22788f5cb150815ef5d13252103"},"taxa":[{"id":"CWE-95","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":"69160cff216abc3e853251e2ed30f4595787fb1d08d171943e58ebb07c00e337"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f0926685abc8be68cf60076cccaa82a214ccdcad8c657b3484bec23fe9b2c57"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"501a7105cd116627b22c5262da74ff9268f1930beaca706a2d5ea003a8d9e5e0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"429634a96345eb95582071f2c2e19110d49e2f19afad700f109ae49f9d03c7a8"},"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":"c8deee7ad8264ed17e66e617f3965d7890e27f46600569b20cb3a7a01f50ac67"},"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":"bf4cb14dd9f12de374cee05990922ff10c2ecaeed59a7757dee5b6e9bf757f74"},"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":"dd1aab51639a48ee9b2b7d7f92ea2adf765e3a0ceaa70e96ae9a1d260223e183"},"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":"e27c660985f009bd923c1bb05144a77dc8221b9e666136fece26085842dbd72e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.17","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0340","RUSTSEC-2026-0343","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"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":"crates/polars-parquet/src/parquet/handwritten_thrift/parquet_macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1a6b8bafc75f4c288e506cf15a74f6b74203e1af8b7f53e0cbfb33e8c1ce9"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 62 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: py-polars/src/polars/_utils/getitem.py, py-polars/src/polars/functions/whenthen.py, crates/polars-expr/src/dispatch/range/linear_space.rs, crates/polars-compute/src/comparisons/list.rs, py-polars/src/polars/functions/range/datetime_range.py, crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs, crates/polars-compute/src/comparisons/array.rs, py-polars/src/polars/datatype_expr/datatype_expr.py (and 54 more) (63 orphaned of 1573 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; 1573 of the 2290 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":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be28d6f7164087aade591aea89b4fd01e8253e0fc4eab5cbc1e659e64da1b5e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/whenthen.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0357eecd9fd817e26a374774ff559e60f5a8831e42819e0deb9e1690c656c592"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4b6d9c00504fa3e3a3815bc14868f2ce52d12f073e2a418673758e946b019b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4bfa9e53febbbc9984134cd2460df2b9d8e3bb5fae113876a91c4fa72619d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/datetime_range.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d021fe2aedd97adefb027be8fd22759d222640e7919478a7c3ee7796f8bd31d8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/optional_masked_dense.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3655a755548c0345719ca973e5b1d1d61ce92129c0b05b640a2962456c17aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfa1e4c545132e747395c6e36ba2d68462b7435d4fc02b2071f19d98550cc57"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/datatype_expr/datatype_expr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0c83e2768c945e15488392b052634cd829abd253d9759f2e744caf02a78dd2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/linear_space.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6027667969ae581c651eea16c4c3c6558201393a74b6e40235d21dd418344dfb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/hyperloglogplus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ff70089bdaf5290ca78c110208dcf42051d6e3cf6b69412b70f514bf58f39f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/date_range.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde79cdac9f66d8097a4f5b9bfb8688397ab601eec86f6118e824c6253d4953c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c9c152097db6556410b63686ef6b9323af701ae9d25ab4c43e0e9552972bb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/int_range.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3b5c7554a30d3106a170ddb9918415884f9c16360fb10b4c454af4e86ba453"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/fixed/decimal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9821e89b48626c64067673890186ae87ab8da4b8972ef2c5d7a9fd00a755eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd58f880618411cb54df2c37e76a9b454e5fff68eeef27395e1cf2330bfc227"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/range/time_range.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6a068fbeac17db9e4846f7f4ea4a1f6264058008ccafc81eaaf55b91154abf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/variable/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae15a24408d0376e77b7481ed21f8cb80150deb858c50539c930225f8e20e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/primitive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575347a020d5973f3a2683f17406ef060f3e22ac35602fe22075e8ae77d44e5a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/aggregation/vertical.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3d85d6eda9e19c386e63c18967062f58c8dd8eafc8bee21ecfb2130993f240"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/trigonometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc39fb679785ed0d12e39de3ee40acb7258e432f69d5993840a8b333389f1d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/peak_minmax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"440f8d7489d8514e3f39ac44d9910509bc781dcc3d89955b0500d139bd104ac1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/type_coercion/datetime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b21720ed828529a3c7fb241d9e2f30b6ed59c57e5707eb5655c8300d4d79a88"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/dispersion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c81b8c85d39c2760dee842032fb3c94b2f519896a2d1c45880b61a0e5c726"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/series/arithmetic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"464c1e2502555534d97bb4f9584da0fff12658e95f523ca4c2cd7b9a9c3821a6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-row/src/widths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b934dd25a625ee510c458cb19120f60883cab6ca4e4c1cc1747f270dccbce3d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/horizontal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2395973b175d991247119fc1272c15c5dd287bfff0905089fbf3f86df96bed4d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/skew_kurtosis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc869d9a8b84368ec42cd1477224f0dbf6d3fe931a2f208cb60fa94b52ff137"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/datetime_range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca547ac7bdff4e20e5ec6b1abeaac0fd32098b2317540c3257b1bd8c54d57438"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1376792b9c3c4c73d48d30a2490b6e529c14bec31b7179ec75c33c0a4e05a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/unordered_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a3501374d8442767dcaa347c3499452ca9a6ff6d8f96a2ca21c95820d2acae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/strip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e683a575ed67f9d0177c341c20885e010a42df46a77e366f20261f37e0785b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/dyn_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79511c49ccd47220f07d6d47b9c0cf1fa1b10e4d5f1107de7ba05032c899c19"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/predicate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9805d86bb3b553cca488f04aa394ba731c68fe63b607745f188cca9360de7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/datatype_fn_to_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de25d8aa422482de92cc8aa88c5ffc916dedb55e337963ea0c592957f55efcf8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cardinality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0bb1be61beb6789bf3e12404cacc2c0d6e49163a8c6be6afb9c855f3bb25dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc0d72906ac7b8b6e44ae430525b1d8a61f04381b3cbf40ee8f5f5c2d0d2c04"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/dispersion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53f1eca507af69edc699d914c0d95672946bb44c7d206dab0393add0ad15aba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-arrow/src/types/aligned_bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b195ca0568c077394bd55c32425baa3e3d8d2dfe11b011a01954fa2e9412ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-async/src/primitives/linearizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e984b5aecac15d4192f6a504bd6548a6927cef480835865894ceb5a5ad133fe1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e889e0ea20949398b5ddb4a4e687c39ad9f8e01c48a224e875c9c9a16f431579"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d976fac3c382409b876c7167eec717c784979d230747d163c1643ce24fa8dec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/flatten_merge_sorted.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cbcca0c50e1b76bab73d5a2c720b43d79e79421e2a9573111f784fd5d8e189"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/datatype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31fe840e7ee6dcb4580601198c28b72a923d0af820813289b1c444c0ba0ebd0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/functions/datatype.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e21ce73a089306670fa77cd0acf11d9230c59e856c4b15bd622c7ed8f44704f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f896ac284e7cc1b433c6870f12dbcc2b6b593b89d3f7ebfc1507c4015553bd87"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"752417fa421b3a7f5f13ad320401448a2e71efcf6307a42722447539aff6f103"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/propagate_dictionary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72735ed39fda6d1c240aa1895a6628e7af415a945b7befd2f8fb502b44cab298"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/aexpr/function_expr/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7433e059da83236001989029be858483dffff56f8e8d9a0c3894b6062c5b166"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/rolling_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5773b74ed7020be1d01f429aa7dc0136d470fb79c116d2e5eb62a374b635315d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/linear_space.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3612c58550d207b6b6003ca2919a0405f47d1def94896c3169b75373e013dabc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-arrow/src/datatypes/reshape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ddfa5dbd9dd199e1ac6a5ab331e20209f46793a049beaf589aa25d22959c49"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c36b709ff98870d7b9098306e777587b71b17019fdb9308d46e8c9b37f67ba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/debug/launch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96fbae43dbc4ece8df610f85054b85fa2185d8cd2e7630f4f1a66cea3a44332"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/cloud_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd008a3918cce515664627a541aceb20968cc8e0d33a31111d848b579e192aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/conversion/datetime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6566aef04a9ee0c23946bdd20becf8528d39a9ee539cd292575b3eaf76a3f60f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/unique/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc8fbf57695293d6ee12f33435ed68352d8c96b5d933c5bc3bc02cea561433b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/expr/datatype_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbc7afd7cfb7deec591fb8398e3c8c2fdd7b7e5ec4e3de2f710bae42eae7b10"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/pyarrow_dataset/functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52368f3b1c4f16f77a62bcd96d2a9e6795dd883c5b64745da542b4e525c3056c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/array_chunks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb4202f22e99fc64e5359ade7b7c709f14504c80000fa4c7ac942b247cae95"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/_utils/construction/other.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a9e8773d0467f5ffe122c4f5bc930ae46ababaede45b1c6ac012175f640faf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/utils/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0b5dbb980b45175f93d780dcbddc49a594b0bdd3edfa4910a50962b350c22c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/comparisons/dictionary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa49cc70e3b82fde6dacf3ddaca0d9512de75628c3158074d7f7e7ea17b40505"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 array.py: \u0060crates/polars-ops/src/chunked_array/array/mod.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d14231ad\u0060 feat: Support integer fixed-array dot products (#28829); \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u00600de37a89\u0060 feat: Introduce \u0060arr.to_struct\u0060 (#14202) (at that commit the file was still \u0060py-polars/polars/expr/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3917a72fc679b995b0e54e3bc499c9a24ca4b2bff033c21d735e288c009279f5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: array.rs \u2194 array.py: \u0060crates/polars-python/src/expr/array.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 89% of the time (25 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026; \u0060aa6f6ec5\u0060 feat: Add \u0060arr.eval\u0060 (#24472) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa7ee4f831dbfc73d8e9b0a092319fc8318fcc01b9c4835f83b4bcd52740b4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: list.rs \u2194 list.py: \u0060crates/polars-python/src/expr/list.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/list.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 85% of the time (23 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u00603bba9f11\u0060 refactor: Re-work \u0060shuffle\u0060 parameter for \u0060sample()\u0060 (#27460); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026; \u0060fa9f3fe6\u0060 feat: Implemented \u0060list.filter\u0060 (#22749) (at that commit the file was still \u0060py-polars/polars/expr/list.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74541f1a1112e2b2638c48015f8666fc2a3b3977e62864e03a3832e7f9f4d494"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: array.rs \u2194 array.py: \u0060crates/polars-python/src/expr/array.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 82% of the time (23 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u0060aa6f6ec5\u0060 feat: Add \u0060arr.eval\u0060 (#24472); \u0060fec73de7\u0060 feat: Add \u0060arr.slice\u0060, \u0060arr.head\u0060 and \u0060arr.tail\u0060 methods to \u0060arr\u0060 nam\u2026 (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a69d8e6c29050277e4a5617a2645e2bb677bd8e3e79021082c1eaae36f64e60"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: array.rs \u2194 array.py: \u0060crates/polars-plan/src/dsl/function_expr/array.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 81% of the time (22 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026; \u0060566d3886\u0060 feat: Implement mean function in \u0060arr\u0060 namespace (#23486) (at that commit the file was still \u0060py-polars/polars/expr/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69113d03eda6fd08cb7c70ba6cb2161472eddbed40c2b392222099e0fdd017e7"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: list.rs \u2194 list.py: \u0060crates/polars-python/src/expr/list.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/list.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 81% of the time (22 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u00603bba9f11\u0060 refactor: Re-work \u0060shuffle\u0060 parameter for \u0060sample()\u0060 (#27460); \u0060fa9f3fe6\u0060 feat: Implemented \u0060list.filter\u0060 (#22749) (at that commit the file was still \u0060py-polars/polars/series/list.py\u0060); \u006047e6c9bb\u0060 feat: Add \u0060nulls_equal\u0060 flag to \u0060list/arr.contains\u0060 (#22773) (at that commit the file was still \u0060py-polars/polars/series/list.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"020d8a66a48dcdd06c1325c7d73f84df7b079494fa782f284b447c557439ba0e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: array.rs \u2194 array.py: \u0060crates/polars-plan/src/dsl/array.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 81% of the time (26 of the 32 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u0060d14231ad\u0060 feat: Support integer fixed-array dot products (#28829); \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u00607cb1174e\u0060 docs: Document that arg_extremum functions return any index on ties (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93582fc590187529dfb081db5a5d7f7bd8442d7566e11c0c5cb7b13f970a873e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: string.rs \u2194 string.py: \u0060crates/polars-python/src/expr/string.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/string.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 78% of the time (40 of the 51 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 40 shared commits counted here, the most recent 3 are \u006016b69e77\u0060 feat: Support regex in \u0060str.split\u0060 (#26060); \u00603e2413c0\u0060 feat: Add leftmost option to \u0060str.replace_many / str.find_many / str.\u2026; \u0060b6687128\u0060 feat: Add dtype to str.to_integer() (#22239) (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2792d39481c4f9e1d4d69d807c1c494ba519d440620a7387ec57133a87f8baa"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: meta.rs \u2194 meta.py: \u0060crates/polars-python/src/expr/meta.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/meta.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 78% of the time (14 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u006049dff65a\u0060 feat: Add \u0060schema\u0060 parameter to \u0060Expr.meta\u0060 properties (#30613); \u00605de4805c\u0060 feat: Add more expression properties to \u0060meta\u0060 namespace (#28091); \u00601af179ab\u0060 refactor: Add schema parameters to \u0060expr.meta\u0060 (#22906) (at that commit the file was still \u0060py-polars/polars/expr/meta.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f734968c91ac34aeb9b2e34495da45cf9f7adf666de17988d9da3aa8e1cd6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: array.rs \u2194 array.py: \u0060crates/polars-plan/src/dsl/function_expr/array.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/array.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 74% of the time (20 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u0060fec73de7\u0060 feat: Add \u0060arr.slice\u0060, \u0060arr.head\u0060 and \u0060arr.tail\u0060 methods to \u0060arr\u0060 nam\u2026 (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060); \u006047e6c9bb\u0060 feat: Add \u0060nulls_equal\u0060 flag to \u0060list/arr.contains\u0060 (#22773) (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27881e5904fc5b88f0acffd5851608574dde800452ed53b0c1c04ba4efdad9a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: dt.rs \u2194 datetime.py: \u0060crates/polars-plan/src/dsl/dt.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/datetime.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 71% of the time (17 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u00609e7b2c92\u0060 chore: Remove a couple of deprecated methods (#28700); \u0060f380d60b\u0060 feat: Support Expr for holidays in business day calculations (#26193); \u0060785ea307\u0060 feat: Add support to output \u0060dt.total_{}()\u0060 duration values as fracti\u2026 (at that commit the file was still \u0060py-polars/polars/series/datetime.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f698325fd62d414a501668e04b685fad1bb2654a88a4c6e60aaec764a91e06"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: dt.rs \u2194 datetime.py: \u0060crates/polars-plan/src/dsl/dt.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/datetime.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 71% of the time (17 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u00609e7b2c92\u0060 chore: Remove a couple of deprecated methods (#28700); \u0060f380d60b\u0060 feat: Support Expr for holidays in business day calculations (#26193); \u0060785ea307\u0060 feat: Add support to output \u0060dt.total_{}()\u0060 duration values as fracti\u2026 (at that commit the file was still \u0060py-polars/polars/expr/datetime.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad17a1c25079c4f00cf502901a5610d0faa250b92f6d16c7ea0685107d283e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: string.rs \u2194 string.py: \u0060crates/polars-python/src/expr/string.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/string.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 71% of the time (36 of the 51 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 36 shared commits counted here, the most recent 3 are \u00603e2413c0\u0060 feat: Add leftmost option to \u0060str.replace_many / str.find_many / str.\u2026; \u0060b6687128\u0060 feat: Add dtype to str.to_integer() (#22239) (at that commit the file was still \u0060py-polars/polars/series/string.py\u0060); \u0060db5c866e\u0060 feat: Allow expression input for \u0060length\u0060 parameter in \u0060pad_start\u0060, \u0060\u2026 (at that commit the file was still \u0060py-polars/polars/series/string.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/expr/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382a6b845d79f4e77be34b66b322aa163bfc1eff6e92f4975c41a4fe7987883d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: binary.rs \u2194 binary.py: \u0060crates/polars-plan/src/dsl/binary.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/binary.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006035b2edf2\u0060 feat: Add get() to retrieve a byte from binary data (#26454); \u00607919df6b\u0060 feat(rust,python): Add \u0060bin.slice()\u0060, \u0060bin.head()\u0060, and \u0060bin.tail()\u0060 \u2026; \u006050e44a29\u0060 refactor: Rename from_buffer()/FromBuffer to reinterpret()/Reinterpre\u2026 (at that commit the file was still \u0060py-polars/polars/expr/binary.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a89fee7db67fbf6c9e0720682c187c38b0b5633f264a11197806dff8ea3d7a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: binary.rs \u2194 binary.py: \u0060crates/polars-plan/src/dsl/function_expr/binary.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/binary.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006035b2edf2\u0060 feat: Add get() to retrieve a byte from binary data (#26454); \u00607919df6b\u0060 feat(rust,python): Add \u0060bin.slice()\u0060, \u0060bin.head()\u0060, and \u0060bin.tail()\u0060 \u2026; \u00605d429ea8\u0060 feat: Reinterpret binary data to fixed size numerical array (#22840) (at that commit the file was still \u0060py-polars/polars/expr/binary.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f01df76b8422a51fd5f0a24aedafddd69cec0ebbff302917ddee7ee021397ed"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: string.rs \u2194 string.py: \u0060crates/polars-plan/src/dsl/string.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/string.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 66% of the time (37 of the 56 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 37 shared commits counted here, the most recent 3 are \u006016b69e77\u0060 feat: Support regex in \u0060str.split\u0060 (#26060); \u00603e2413c0\u0060 feat: Add leftmost option to \u0060str.replace_many / str.find_many / str.\u2026; \u0060b6687128\u0060 feat: Add dtype to str.to_integer() (#22239) (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c456eba727beec25e81f2be2067f1c651a662c4a276543dbb7f311bbc58f9f66"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: sink.rs \u2194 partition.py: \u0060crates/polars-python/src/lazyframe/sink.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/partition.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602273b001\u0060 refactor: Update partitioned sink IR (#25524); \u006022f9dc5f\u0060 refactor: Simplify sink parameter passing from Python (#25302); \u00605993d953\u0060 feat: Add per partition sort and finish callback to sinks (#22789) (at that commit the file was still \u0060py-polars/polars/io/partition.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada86ccb83fd5fc397e2eede1d28e577b453eeb737dc5e4418860d04d9c3385"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: expand_datasets.rs \u2194 _options.py: \u0060crates/polars-plan/src/plans/optimizer/expand_datasets.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/scan_options/_options.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060bdbf3bf2\u0060 feat: Answer min, max and counts over an Iceberg scan from manifest s\u2026; \u0060eb8db318\u0060 fix: Load Delta partition values from the log in \u0060scan_delta\u0060 (#30052); \u0060fe841f95\u0060 perf: Prepare Parquet scans for row-group splitting in Polars Cloud (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/expand_datasets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97085d6b6408a38db844e2c483568d3aa4333a0fcfbeb825cba2b8538d0f6a9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: boolean.rs \u2194 expr.py: \u0060crates/polars-plan/src/dsl/function_expr/boolean.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/expr.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00609472f7d9\u0060 feat: Add \u0060Expr.is_sorted\u0060 (#26708); \u0060447664f9\u0060 feat: Add Rust backend for Expr.has_nulls (#27590); \u006040278608\u0060 feat: Add \u0060is_close\u0060 method (#23273) (at that commit the file was still \u0060py-polars/polars/expr/expr.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6a22d433bf1e10d206e43dbbff405a0376467b66eb9e244732b11c4d6e1741"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: strings.rs \u2194 string.py: \u0060crates/polars-plan/src/dsl/function_expr/strings.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/string.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 55% of the time (43 of the 78 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are \u006016b69e77\u0060 feat: Support regex in \u0060str.split\u0060 (#26060); \u00603e2413c0\u0060 feat: Add leftmost option to \u0060str.replace_many / str.find_many / str.\u2026; \u0060b6687128\u0060 feat: Add dtype to str.to_integer() (#22239) (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e48d6c2612807f3854b4440de9ceb438f135ca5e2142576643b44f573ade0f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: streaming.rs \u2194 functions.py: \u0060crates/polars-io/src/csv/read/streaming.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/csv/functions.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006098d2afff\u0060 feat(python!): Dispatch read_csv to scan_csv (#28413); \u00603a780c26\u0060 feat!: Respect file column order when schema is given for \u0060scan_csv()\u2026; \u0060c6e05d16\u0060 fix: Resolve CSV column names overwrite in DSL-\u003EIR conversion (#28383) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a62316101639929c0e6108210d088814c12fa6410ca38401cf1668ff07aa5ba"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rolling.rs \u2194 expr.py: \u0060crates/polars-plan/src/dsl/function_expr/rolling.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/expr.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060ef1275f7\u0060 feat: Make \u0060rolling_map\u0060 serializable (#23848) (at that commit the file was still \u0060py-polars/polars/expr/expr.py\u0060); \u006035808295\u0060 feat: Add \u0060rolling_kurtosis\u0060 (#22335) (at that commit the file was still \u0060py-polars/polars/expr/expr.py\u0060); \u0060beebada8\u0060 perf: Dedicated \u0060rolling_skew\u0060 kernel (#22333) (at that commit the file was still \u0060py-polars/polars/expr/expr.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/rolling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0bc6d3d24b9feab488e65cd6a561a5bdae34abdeb6a7a1d57f5e4c1f1801ac"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lower_ir.rs \u2194 partition.py: \u0060crates/polars-stream/src/physical_plan/lower_ir.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/partition.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602273b001\u0060 refactor: Update partitioned sink IR (#25524); \u00605993d953\u0060 feat: Add per partition sort and finish callback to sinks (#22789) (at that commit the file was still \u0060py-polars/polars/io/partition.py\u0060); \u0060ebe03be7\u0060 feat: Allow sinking to abstract python \u0060io\u0060 and \u0060fs\u0060 classes (#21987) (at that commit the file was still \u0060py-polars/polars/io/partition.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfa8c422a17fc7979e67322dba115c45e28fb10f0262904b7addf49435d4f92"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: list.rs \u2194 list.py: \u0060crates/polars-plan/src/dsl/list.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/list.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 52% of the time (21 of the 40 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u00607cb1174e\u0060 docs: Document that arg_extremum functions return any index on ties (\u2026; \u00603bba9f11\u0060 refactor: Re-work \u0060shuffle\u0060 parameter for \u0060sample()\u0060 (#27460); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d664914eaaf23c9050ef106dcb0c07d13b878d0364e1582cb49edb3f2204b70"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: boolean.rs \u2194 series.py: \u0060crates/polars-plan/src/dsl/function_expr/boolean.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/series.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006040278608\u0060 feat: Add \u0060is_close\u0060 method (#23273) (at that commit the file was still \u0060py-polars/polars/series/series.py\u0060); \u00604e4d259d\u0060 feat: Add \u0027nulls_equal\u0027 parameter to \u0060is_in\u0060 (#21426) (at that commit the file was still \u0060py-polars/polars/series/series.py\u0060); \u00607b6f9275\u0060 feat: add integer negation (#14049) (at that commit the file was still \u0060py-polars/polars/series/series.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1a65af1ad7542606057c37ccb6352133615a0aaf631f92dc25125b97021187"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 string.py: \u0060crates/polars-ops/src/chunked_array/strings/mod.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/string.py\u0060 (context py-polars) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006074dad84e\u0060 feat: Add \u0060str.normalize()\u0060 (#20483) (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060); \u0060791c336f\u0060 feat: Added \u0060escape_regex\u0060 operation to the \u0060str\u0060 namespace and as a \u2026 (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060); \u0060ecc5c4cc\u0060 feat: str namespace; add aho-corasick expressions: \u0027contains_any\u0027 and\u2026 (at that commit the file was still \u0060py-polars/polars/expr/string.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca672b130d83666bfa5bdee97131afed23f44e139bd49cce71fbe401e555c6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ndjson.rs \u2194 _options.py: \u0060crates/polars-lazy/src/scan/ndjson.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/scan_options/_options.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060eb8db318\u0060 fix: Load Delta partition values from the log in \u0060scan_delta\u0060 (#30052); \u0060fe841f95\u0060 perf: Prepare Parquet scans for row-group splitting in Polars Cloud (\u2026; \u00607a943016\u0060 refactor: Add expand_paths parameter to toggle path expansion (#29210) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/scan/ndjson.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"659938bde3293e2a175bfc04cc1de0e8eff1d906c81bc3557503ed8a6d80532d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: parquet.rs \u2194 _options.py: \u0060crates/polars-lazy/src/scan/parquet.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/scan_options/_options.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060eb8db318\u0060 fix: Load Delta partition values from the log in \u0060scan_delta\u0060 (#30052); \u0060fe841f95\u0060 perf: Prepare Parquet scans for row-group splitting in Polars Cloud (\u2026; \u00607a943016\u0060 refactor: Add expand_paths parameter to toggle path expansion (#29210) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/scan/parquet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9114c7406539d6eb1f6a6add0f3da90c83691827f3c76296ece42f1a1dc4809"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: iterator.rs \u2194 array.py: \u0060crates/polars-core/src/chunked_array/array/iterator.rs\u0060 (context crates) and \u0060py-polars/src/polars/expr/array.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e1bba070\u0060 feat: Implements \u0060arr.n_unique\u0060 (#15296) (at that commit the file was still \u0060py-polars/polars/expr/array.py\u0060); \u0060279540f0\u0060 feat: Implements \u0060arr.shift\u0060 (#14298) (at that commit the file was still \u0060py-polars/polars/expr/array.py\u0060); \u0060fb40db74\u0060 feat: Impl \u0060join\u0060 for ArrayNameSpace (#13586) (at that commit the file was still \u0060py-polars/polars/expr/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a7b1679548cc14852ee366123271c5472abcaef00e14b7ae66879f4bcbb710"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: iterator.rs \u2194 array.py: \u0060crates/polars-core/src/chunked_array/array/iterator.rs\u0060 (context crates) and \u0060py-polars/src/polars/series/array.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e1bba070\u0060 feat: Implements \u0060arr.n_unique\u0060 (#15296) (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060); \u0060279540f0\u0060 feat: Implements \u0060arr.shift\u0060 (#14298) (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060); \u0060fb40db74\u0060 feat: Impl \u0060join\u0060 for ArrayNameSpace (#13586) (at that commit the file was still \u0060py-polars/polars/series/array.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d70f3d42c4aee016bc86c228d988d229bc648f41f15ba9320e94662b276d2b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: csv.rs \u2194 _options.py: \u0060crates/polars-lazy/src/scan/csv.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/scan_options/_options.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060eb8db318\u0060 fix: Load Delta partition values from the log in \u0060scan_delta\u0060 (#30052); \u0060fe841f95\u0060 perf: Prepare Parquet scans for row-group splitting in Polars Cloud (\u2026; \u00607a943016\u0060 refactor: Add expand_paths parameter to toggle path expansion (#29210) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-lazy/src/scan/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8afa6c259e87b8f61a81442e9ffebd5b722ad410151861493b4104d06d3605"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: functions.rs \u2194 _options.py: \u0060crates/polars-mem-engine/src/scan_predicate/functions.rs\u0060 (context crates) and \u0060py-polars/src/polars/io/scan_options/_options.py\u0060 (context py-polars) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060bdbf3bf2\u0060 feat: Answer min, max and counts over an Iceberg scan from manifest s\u2026; \u0060eb8db318\u0060 fix: Load Delta partition values from the log in \u0060scan_delta\u0060 (#30052); \u0060fe841f95\u0060 perf: Prepare Parquet scans for row-group splitting in Polars Cloud (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/scan_predicate/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe42a6dda3f3a61a62c3e3fc0c57c227064d56c09f15b65a0b8c0f55b1ea953"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 sql.rs: \u0060crates/polars-sql/src/lib.rs\u0060 and \u0060crates/polars/src/sql.rs\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006046b62a71\u0060 feat: Support SQL time travel on attached Iceberg catalog tables (#30\u2026; \u0060ec0f9b33\u0060 feat: Support SQL \u0060MERGE INTO\u0060 on attached Iceberg catalog tables (#3\u2026; \u0060077d0b23\u0060 feat: Support SQL \u0060TRUNCATE\u0060 on attached Iceberg catalog tables (#30477) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f0e3934e17d35b6b31ebd755b961712d6ccb185f6455100b72c55b9364fdf7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: array.rs \u2192 iterator.rs, mod.rs, array.rs, array.rs: \u0060crates/polars-python/src/expr/array.rs\u0060 changes together with 4 other files \u2014 \u0060crates/polars-core/src/chunked_array/array/iterator.rs\u0060, \u0060crates/polars-ops/src/chunked_array/array/mod.rs\u0060, \u0060crates/polars-plan/src/dsl/array.rs\u0060, \u0060crates/polars-plan/src/dsl/function_expr/array.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":"crates/polars-python/src/expr/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c85e067e139e0880376874ea921f5ee63739445b70b775954d04a80f4b2659"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dt.rs \u2194 datetime.rs: \u0060crates/polars-plan/src/dsl/dt.rs\u0060 and \u0060crates/polars-python/src/expr/datetime.rs\u0060 change together 90% of the time (18 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u00609e7b2c92\u0060 chore: Remove a couple of deprecated methods (#28700); \u0060f380d60b\u0060 feat: Support Expr for holidays in business day calculations (#26193); \u0060785ea307\u0060 feat: Add support to output \u0060dt.total_{}()\u0060 duration values as fracti\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/dt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8463a072372f58d726b7fb57a235555972dbc4cf143d14c364c99bb0309129"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: strings.rs \u2192 mod.rs, namespace.rs, string.rs: \u0060crates/polars-plan/src/dsl/function_expr/strings.rs\u0060 changes together with 3 other files \u2014 \u0060crates/polars-ops/src/chunked_array/strings/mod.rs\u0060, \u0060crates/polars-ops/src/chunked_array/strings/namespace.rs\u0060, \u0060crates/polars-python/src/expr/string.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":"crates/polars-plan/src/dsl/function_expr/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e243901a31a8ae618bf54986d5a0fdac1a2b0b97852f688b69d3cf6f6cd30"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: determinism.rs \u2192 misc.rs, functions.rs, ir_to_dsl.rs: \u0060crates/polars-plan/src/plans/aexpr/determinism.rs\u0060 changes together with 3 other files \u2014 \u0060crates/polars-expr/src/dispatch/misc.rs\u0060, \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs\u0060, \u0060crates/polars-plan/src/plans/conversion/ir_to_dsl.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":"crates/polars-plan/src/plans/aexpr/determinism.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c97dcaf355ffe002dcef7a8c7bac12e3535d3de636d2428311470019446d02a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: functions.rs \u2194 ir_to_dsl.rs: \u0060crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs\u0060 and \u0060crates/polars-plan/src/plans/conversion/ir_to_dsl.rs\u0060 change together 84% of the time (54 of the 64 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 54 shared commits counted here, the most recent 3 are \u0060d9e5ab1a\u0060 fix: Make \u0060Expr.entropy\u0060 corner cases consistent across engines (#30699); \u0060b90f6252\u0060 feat(python): Support sinking to Iceberg table with bucket partitione\u2026; \u006087e44d7b\u0060 feat: Cast the needle of \u0060is_in\u0060 and Map lookups exactly or not at al\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6903752e4a9bbc8e68c12244227ba5fb27f039b78f06349a5372a7a77a33b56"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: string.rs \u2194 string.rs: \u0060crates/polars-plan/src/dsl/string.rs\u0060 and \u0060crates/polars-python/src/expr/string.rs\u0060 change together 82% of the time (42 of the 51 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 42 shared commits counted here, the most recent 3 are \u006016b69e77\u0060 feat: Support regex in \u0060str.split\u0060 (#26060); \u00603e2413c0\u0060 feat: Add leftmost option to \u0060str.replace_many / str.find_many / str.\u2026; \u0060b6687128\u0060 feat: Add dtype to str.to_integer() (#22239) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d402a89a04845b1f9f2f5980ebe949c59ccff8fc3bc123f4548af3970b2535"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: list.rs \u2194 list.rs: \u0060crates/polars-plan/src/dsl/list.rs\u0060 and \u0060crates/polars-python/src/expr/list.rs\u0060 change together 81% of the time (22 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u00603bba9f11\u0060 refactor: Re-work \u0060shuffle\u0060 parameter for \u0060sample()\u0060 (#27460); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026; \u0060551ff1fb\u0060 refactor: Make \u0060list.to_struct\u0060 and \u0060arr.to_struct\u0060 serializable (#23\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b13bd634a0cd543d5611fa87583466be5748ae467b21e2b5a1c52ede442345b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fmt.rs \u2194 to_graph.rs: \u0060crates/polars-stream/src/physical_plan/fmt.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_graph.rs\u0060 change together 79% of the time (54 of the 68 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 54 shared commits counted here, the most recent 3 are \u00601af57752\u0060 refactor(rust): Expose \u0060bytes_per_source\u0060 in physical plan (#29349); \u00607b187dca\u0060 perf: Rechunk before selecting in group-by pre-select (#29219); \u00603a780c26\u0060 feat!: Respect file column order when schema is given for \u0060scan_csv()\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/physical_plan/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ede8ec6b0c5d3ee6d490b03e4e7415021c6a33bc4b550162a4a189a734e8369"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: partition_by.rs \u2194 single_file.rs: \u0060crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/partition_by.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/single_file.rs\u0060 change together 77% of the time (10 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00605e32866c\u0060 fix: Don\u0027t finish a sink\u0027s output file when its query fails (#30279); \u0060f6408481\u0060 fix: Fix EntityTooSmall on sink_ipc to S3 (#28255); \u006093bfdf9f\u0060 perf: Remove excess memory copy in streaming IPC sink (#28141) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/partition_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a688917fa748d1cf0f2a7ea2f41fef8e346029bc268e5e7c640fc4f9a61ee8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 array.rs: \u0060crates/polars-ops/src/chunked_array/array/mod.rs\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/array.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006060cb846f\u0060 feat: Add native fixed-array dot (#28504); \u0060775152f4\u0060 feat: \u0060list\u0060 \u0026 \u0060array\u0060 measures of dispersion (#13245); \u00605fbce482\u0060 feat: Impl \u0060count_matches\u0060 for array namespace (#13675) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/array/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89873c14892711a1519173e75521a4e00cb2fe48ed3c2005054067e99b266a7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: meta.rs \u2194 meta.rs: \u0060crates/polars-plan/src/dsl/meta.rs\u0060 and \u0060crates/polars-python/src/expr/meta.rs\u0060 change together 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006049dff65a\u0060 feat: Add \u0060schema\u0060 parameter to \u0060Expr.meta\u0060 properties (#30613); \u00605de4805c\u0060 feat: Add more expression properties to \u0060meta\u0060 namespace (#28091); \u00601af179ab\u0060 refactor: Add schema parameters to \u0060expr.meta\u0060 (#22906) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7542eb3a180e786425d2c8936a08658ad4c30f042e4189e36f6ce1bfa130ca11"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: list.rs \u2194 list.rs: \u0060crates/polars-plan/src/dsl/function_expr/list.rs\u0060 and \u0060crates/polars-python/src/expr/list.rs\u0060 change together 70% of the time (19 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u00603bba9f11\u0060 refactor: Re-work \u0060shuffle\u0060 parameter for \u0060sample()\u0060 (#27460); \u0060ff62eb51\u0060 perf: Dispatch \u0060{list,arr}.{unique,n_unique,reverse}\u0060 to group_by eng\u2026; \u0060551ff1fb\u0060 refactor: Make \u0060list.to_struct\u0060 and \u0060arr.to_struct\u0060 serializable (#23\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5c70be46045a376e81afdb62605d407d7dd4520bb5260a90bb0f1fba0543ea"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: datetime.rs \u2194 datetime.rs: \u0060crates/polars-plan/src/dsl/function_expr/datetime.rs\u0060 and \u0060crates/polars-python/src/expr/datetime.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00609e7b2c92\u0060 chore: Remove a couple of deprecated methods (#28700); \u0060785ea307\u0060 feat: Add support to output \u0060dt.total_{}()\u0060 duration values as fracti\u2026; \u006052eea507\u0060 feat: Implement \u0060dt.days_in_month\u0060 function (#23119) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/datetime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b3630a23164d8031770e99b9f39463d18fc0e1a823e517cd07cedeb7fd94e6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dispatch_left_right.rs \u2194 mod.rs: \u0060crates/polars-ops/src/frame/join/dispatch_left_right.rs\u0060 and \u0060crates/polars-ops/src/frame/join/hash_join/mod.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060f16e1817\u0060 fix: More careful slice pushdown into joins (#28578); \u0060961f45f5\u0060 feat: Add POLARS_OOC_DISK_BUDGET_MB (#28045); \u0060f826c32d\u0060 feat: Periodically check python signals (\u0027CTRL-C\u0027 handling) (#20826) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/dispatch_left_right.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6688c0a8fc313a3ef5f5ba6348cd0c6db93e47731c9f92b5e9907c1e001571"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lower_ir.rs \u2192 sink.rs, row_deletions.rs, to_graph.rs: \u0060crates/polars-stream/src/physical_plan/lower_ir.rs\u0060 changes together with 3 other files \u2014 \u0060crates/polars-python/src/lazyframe/sink.rs\u0060, \u0060crates/polars-stream/src/nodes/io_sources/multi_scan/components/row_deletions.rs\u0060, \u0060crates/polars-stream/src/physical_plan/to_graph.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":"crates/polars-stream/src/physical_plan/lower_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b0e3cc2c19abb5c7cc918ca07ca685ae42407eb1ff1c18ed3aa44c1197450a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: default.rs \u2194 groups.rs: \u0060crates/polars-ops/src/frame/join/asof/default.rs\u0060 and \u0060crates/polars-ops/src/frame/join/asof/groups.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00608bd626a6\u0060 perf: Push as-of join key filters to the right input (#30123); \u006046b27141\u0060 feat: Add \u0027allow_exact_matches\u0027 join_asof\u0027 (#20723); \u00601a9c7709\u0060 perf: fix regression non-null asof join (#11984) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/frame/join/asof/default.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b98139b6e049d5ff6972dc0289a43cc2d8a32505e05e715921b96d918754d06"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060crates/polars-stream/src/nodes/io_sources/csv/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/ndjson/mod.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060c0dee8fa\u0060 perf: Limit the bytes of local CSV and NDJSON files read at once in m\u2026; \u0060e880400f\u0060 perf: Reduce requests and raise concurrency for cloud CSV scans (#29863); \u00602e5ec84f\u0060 perf: Reduce requests and raise concurrency for cloud NDJSON scans (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef9a6c10ea7e8c6692432dd0891e9be38fe61a03d8c1b15cb462fb80e1b5f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: _dataset.py \u2194 _options.py: \u0060py-polars/src/polars/io/iceberg/_dataset.py\u0060 and \u0060py-polars/src/polars/io/scan_options/_options.py\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060bdbf3bf2\u0060 feat: Answer min, max and counts over an Iceberg scan from manifest s\u2026; \u00601eb456a7\u0060 perf(python): Reuse Iceberg data file sizes (#29063); \u00603e6dbf02\u0060 depr(python): Deprecate \u0060retries=n\u0060 in favor of \u0060storage_options={\u0022ma\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/src/polars/io/iceberg/_dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8ea5994e6fde4e86393a5268f733b25f186cc627e322e13c04f64441c3d7f2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: iterator.rs \u2194 array.rs: \u0060crates/polars-core/src/chunked_array/array/iterator.rs\u0060 and \u0060crates/polars-plan/src/dsl/array.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e1bba070\u0060 feat: Implements \u0060arr.n_unique\u0060 (#15296); \u0060279540f0\u0060 feat: Implements \u0060arr.shift\u0060 (#14298); \u0060fb40db74\u0060 feat: Impl \u0060join\u0060 for ArrayNameSpace (#13586) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d968faa2d948fc0934c416e2c457a30b1169ae41bbb70ddc7f5d87921f5fce"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: projection.rs \u2194 stack.rs: \u0060crates/polars-mem-engine/src/executors/projection.rs\u0060 and \u0060crates/polars-mem-engine/src/executors/stack.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060ca8c1ef9\u0060 fix: Allow nested \u0060is_in()\u0060 in \u0060when()/then()\u0060 for full-streaming (#2\u2026; \u00600f647852\u0060 perf: Rechunk in DataFrame.rows if needed (#19628); \u00600161efda\u0060 feat(rust): eliminate ProjectionExprs and handle CSE by stacking extr\u2026 (at that commit the files were still \u0060crates/polars-lazy/src/physical_plan/executors/projection.rs\u0060 and \u0060crates/polars-lazy/src/physical_plan/executors/stack.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/executors/projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b1f211f5ef0c2f7b3d8649250780d71fc1b4ee541eb5d23dbfabb16cb98515"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: namespace.rs \u2194 binary.rs: \u0060crates/polars-ops/src/chunked_array/binary/namespace.rs\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/binary.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00607919df6b\u0060 feat(rust,python): Add \u0060bin.slice()\u0060, \u0060bin.head()\u0060, and \u0060bin.tail()\u0060 \u2026; \u00605d429ea8\u0060 feat: Reinterpret binary data to fixed size numerical array (#22840); \u006050e44a29\u0060 refactor: Rename from_buffer()/FromBuffer to reinterpret()/Reinterpre\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/namespace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"768e0c60754e3946eeca62912c9749860ce9f3686a1f55535ea942d094c89591"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mean.rs \u2194 sum.rs: \u0060crates/polars-expr/src/reduce/mean.rs\u0060 and \u0060crates/polars-expr/src/reduce/sum.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060cdca1b64\u0060 perf: Vectorize Decimal mean and sum reductions (#30704); \u006093a0ff85\u0060 perf: Spread decimal sums and means over lanes and check the sum\u0027s 38\u2026; \u0060a9effe7d\u0060 perf: Add eviction-free path to GroupedReduction, with lanes (#29613) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/mean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13264ac120a67435a3b644538930ef595fe8a0cf4dfe2ce8f5ce063ec23b30b4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: callback.rs \u2194 on_startup.rs: \u0060crates/polars-plan/src/callback.rs\u0060 and \u0060crates/polars-python/src/on_startup.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608a876161\u0060 feat: New Expression and function: pipe_with_dtype (#29547); \u00602273b001\u0060 refactor: Update partitioned sink IR (#25524); \u006070f39e0c\u0060 refactor(rust): Take \u0060\u0026dyn Any\u0060 instead of \u0060Box\u003Cdyn Any\u003E\u0060 in python o\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/callback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85604b71c6b5bd237e8c066ff444eac64aa471ab5e1dc71abb0c0e4e959ce5b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sink.rs \u2194 to_graph.rs: \u0060crates/polars-python/src/lazyframe/sink.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/to_graph.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060952f9707\u0060 refactor(rust): Remove old sink IR (#26130); \u00605993d953\u0060 feat: Add per partition sort and finish callback to sinks (#22789); \u0060ebe03be7\u0060 feat: Allow sinking to abstract python \u0060io\u0060 and \u0060fs\u0060 classes (#21987) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-python/src/lazyframe/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a23b8fa8836795fbdf21b711b0c265c9ce28835756ab5c7d6a42f2053cebc2f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/parquet/mod.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608e83bc55\u0060 feat: Re-work behavior of arrow_schema parameter on sink_parquet (#26\u2026; \u0060965b0631\u0060 refactor(rust): Pass \u0060sync_on_close\u0060 and \u0060num_pipelines\u0060 via \u0060start_f\u2026 (at that commit the files were still \u0060crates/polars-stream/src/nodes/io_sinks2/writers/ipc/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks2/writers/parquet/mod.rs\u0060); \u00607b70f90d\u0060 refactor(rust): Rename \u0060FileType\u0060 to \u0060FileWriteFormat\u0060 (#25951) (at that commit the files were still \u0060crates/polars-stream/src/nodes/io_sinks2/writers/ipc/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks2/writers/parquet/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/writers/ipc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ded91e9eb6d3cfdca42a2ae9eb3c7519cbeb1434d2c649910d7ccd77bc16bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: rolling.rs \u2194 schema.rs: \u0060crates/polars-plan/src/dsl/function_expr/rolling.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/schema.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060ef1275f7\u0060 feat: Make \u0060rolling_map\u0060 serializable (#23848); \u00601e64bb20\u0060 refactor(rust): Move \u0060options\u0060 out of \u0060RollingFunction\u0060 (#23430); \u006035808295\u0060 feat: Add \u0060rolling_kurtosis\u0060 (#22335) (at that commit the file was still \u0060crates/polars-plan/src/dsl/function_expr/schema.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/function_expr/rolling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d75120c51a119ff269192436fba8238751d40ed739754330837eb0f662686"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 fmt.rs: \u0060crates/polars-stream/src/nodes/joins/mod.rs\u0060 and \u0060crates/polars-stream/src/physical_plan/fmt.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060032a7656\u0060 feat: Add a streaming range-join (#26790); \u00607326130c\u0060 feat: Add streaming \u0060AsOf\u0060 join node (#26398); \u0060a98888e6\u0060 feat(rust): Add streaming merge-join (#25964) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fce307d8ecbbd2403d40f91e37f226c39d0240b6815414c187824972dc36cb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: single_file.rs \u2194 io_writer.rs: \u0060crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/single_file.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sinks/writers/ipc/io_writer.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00605e32866c\u0060 fix: Don\u0027t finish a sink\u0027s output file when its query fails (#30279); \u0060f6408481\u0060 fix: Fix EntityTooSmall on sink_ipc to S3 (#28255); \u006093bfdf9f\u0060 perf: Remove excess memory copy in streaming IPC sink (#28141) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sinks/pipeline_initialization/single_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4bda2f1f2211012ffe6eed170323da4043cf58d1597ab313d5384ff326b7ce"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: read_impl.rs \u2194 schema_inference.rs: \u0060crates/polars-io/src/csv/read/read_impl.rs\u0060 and \u0060crates/polars-io/src/csv/read/schema_inference.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603a780c26\u0060 feat!: Respect file column order when schema is given for \u0060scan_csv()\u2026; \u0060f8dc1120\u0060 feat: Implement streaming CSV schema inference (#25911); \u00606b174770\u0060 fix: Allow \u0060decimal_comma\u0060 with \u0060,\u0060 separator in \u0060read_csv\u0060 (#23657) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/csv/read/read_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0102b0ea7ba1ecdef67e2a0717cc40ff05be0e4a5921aad5566a884ca7766bf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: log.rs \u2194 schema.rs: \u0060crates/polars-ops/src/series/ops/log.rs\u0060 and \u0060crates/polars-plan/src/plans/aexpr/function_expr/schema.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060d9e5ab1a\u0060 fix: Make \u0060Expr.entropy\u0060 corner cases consistent across engines (#30699); \u0060ff03602b\u0060 refactor(rust): Improve various error messages across the codebase (#\u2026; \u00604a36b157\u0060 fix: Reject non-numeric input and preserve \u0060Decimal\u0060 scale in \u0060entrop\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fbd90bd2a8146e969d19e5160d9e9b09275ed2a91d06ac1a336ce8a5c352a1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 init.rs: \u0060crates/polars-stream/src/nodes/io_sources/ipc/mod.rs\u0060 and \u0060crates/polars-stream/src/nodes/io_sources/parquet/init.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00608cd9f587\u0060 perf: Let the scan pipeline window follow the in-flight byte budget (\u2026; \u00608739d1fb\u0060 perf: Increase prefetch window for ordered Parquet and IPC scans (#29\u2026; \u0060bb845c1b\u0060 fix(rust): Compile polars-stream with only the IPC feature (#30051) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad20e41f6d88e942b240fca3bd829b591215413b1ed14b1cf083e755f823f148"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 string.rs: \u0060crates/polars-ops/src/chunked_array/strings/mod.rs\u0060 and \u0060crates/polars-python/src/expr/string.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006074dad84e\u0060 feat: Add \u0060str.normalize()\u0060 (#20483); \u0060791c336f\u0060 feat: Added \u0060escape_regex\u0060 operation to the \u0060str\u0060 namespace and as a \u2026; \u0060ecc5c4cc\u0060 feat: str namespace; add aho-corasick expressions: \u0027contains_any\u0027 and\u2026 (at that commit the file was still \u0060py-polars/src/expr/string.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af170c0ee644c1f69a1b9f5072b96365a3bb115609083e32c78cbb82b4d3c94d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: namespace.rs \u2194 binary.rs: \u0060crates/polars-ops/src/chunked_array/binary/namespace.rs\u0060 and \u0060crates/polars-plan/src/dsl/binary.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00607919df6b\u0060 feat(rust,python): Add \u0060bin.slice()\u0060, \u0060bin.head()\u0060, and \u0060bin.tail()\u0060 \u2026; \u006050e44a29\u0060 refactor: Rename from_buffer()/FromBuffer to reinterpret()/Reinterpre\u2026; \u0060da51207e\u0060 feat: Add \u0060bin.reinterpret\u0060 (#20263) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/binary/namespace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a89c162cd873c1a18084c1be213c8b9779e3130175b88d2c9f4c0671691a338"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: iterator.rs \u2194 array.rs: \u0060crates/polars-core/src/chunked_array/array/iterator.rs\u0060 and \u0060crates/polars-plan/src/dsl/function_expr/array.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e1bba070\u0060 feat: Implements \u0060arr.n_unique\u0060 (#15296); \u0060279540f0\u0060 feat: Implements \u0060arr.shift\u0060 (#14298); \u0060fb40db74\u0060 feat: Impl \u0060join\u0060 for ArrayNameSpace (#13586) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/array/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0161c83298a8ea35546262461e788c25926c6aa3391268b672b43d65452b8f5e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060crates/polars-config/src/lib.rs\u0060 and \u0060crates/polars-ooc/src/lib.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006024df2cfa\u0060 perf: Add memory grant system and use in group_by (#30524); \u0060d02c6217\u0060 perf: Return freed memory to the OS right away while out-of-core data\u2026; \u0060961f45f5\u0060 feat: Add POLARS_OOC_DISK_BUDGET_MB (#28045) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-config/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"162524610914359f9f8625c8da7f941bde93e8ce286ac40dc638b420f55b8e87"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"328169df29c2a88f014fa56618757345d9102f9b5fb58707be82f9e8db86c47a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fe30f97d6dbb6a8d2a5b076c6f927c4e17efe87a73eb82120cf9c3376903a44"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c900bde0932be250e4bf57e5242fcec56f9d24a97d059ece5c779a74876af50"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04c570606e325e986757cbfd942569ed0a569e779692a18cccfdc307c337d1c1"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cc5b970391a7af1e31b34e11f67f80067df7450023ff3822bebf5ab9ce7da71"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d017d9c13ee28934bf254a7ae0d34a44712f5b30a1856936a0d1f120276d5369"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8daf875c35e515b3ed8b856a32caad3e0ff86ba1f3ef2e88685e1bb7aed14622"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1d813df087b6cde96608109c1bc3d3b6140d779109eb2f9995648b74ceaabe4"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"659c27ce4a7119995f6fcf3f953e89d91772a923706fa20a1628e7a1e79c3d81"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbfce727b0042684fc98e9aeafd51b7976da8381183065745ecdd58cf53df95b"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c8a3c3030f06068754bf48fe10b1bbd32152b0dc0c1032a4aeee826b13e747c"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b783e15fc53c872618b518c0deb228ac126e681092b0bf1b15f26b6f1b2e1856"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233014b98bf943f3afbf3ef6ae4349904925dd4e5e9574a992a5e2896789a087"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5451f19eaf7542887d8569c720135e1e15d4821212a5b3066efd022123239dec"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9b1655ecd0a860192435517aea0c57a7c1606f66ae8063ceda342af83bf2e73"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1053a5885cb35cf0350a4a2ddaa948c2ced1e814c3f036cdc909a2c31d2b6330"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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 \u0060polars_compute.arithmetic\u0060 is marked as implementation by its own namespace, folder or name: \u0060PrimitiveArithmeticKernelImpl\u0060 (crates/polars-compute/src/arithmetic/mod.rs:90, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/arithmetic/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89dc44d942683feee015480049469383b517b3b725dbf83b30873b1038d2187"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_compute.cast\u0060 is marked as implementation by its own namespace, folder or name: \u0060CastOptionsImpl\u0060 (crates/polars-compute/src/cast/mod.rs:37, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/cast/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"95761bde2299f315af97e585099ebbc979ffacf35a7107d899cab8fa325ff673"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_core.datatypes.extension\u0060 is marked as implementation by its own namespace, folder or name: \u0060ExtensionTypeImpl\u0060 (crates/polars-core/src/datatypes/extension/mod.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":"crates/polars-core/src/datatypes/extension/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a281aa9d168a5d768df2f29118e499ddd1dbd66222ffd2f44a781340b75de6"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_core.series.implementations.null\u0060 is marked as implementation by its own namespace, folder or name: \u0060NullChunked\u0060 (crates/polars-core/src/series/implementations/null.rs:19, \u0060implementations\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/implementations/null.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9217ee9a7617dcd180f5196afa3b5c8d1bb0cc6e648bfc74efad6aa554d9a8f6"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_ops.chunked_array.list.namespace\u0060 is marked as implementation by its own namespace, folder or name: \u0060ListNameSpaceImpl\u0060 (crates/polars-ops/src/chunked_array/list/namespace.rs:53, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/list/namespace.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8fc5fa337a09fe6c8d1b2665ea41305acf188db9161b861b20b392b0f9616a"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_ops.chunked_array.strings.json_path\u0060 is marked as implementation by its own namespace, folder or name: \u0060Utf8JsonPathImpl\u0060 (crates/polars-ops/src/chunked_array/strings/json_path.rs:42, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/json_path.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f167a335d8b942492ca45e181ddce05e8e470659431c1c48953ffe3bcb6c75"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_ops.chunked_array.strings.namespace\u0060 is marked as implementation by its own namespace, folder or name: \u0060StringNameSpaceImpl\u0060 (crates/polars-ops/src/chunked_array/strings/namespace.rs:333, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/chunked_array/strings/namespace.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b800779c911c12a5d83bc065b3df5105a84c8852701b3b894b6a3ebd20e1a1"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060polars_plan.traversal.tree_traversal\u0060 is marked as implementation by its own namespace, folder or name: \u0060TreeTraversalImpl\u0060 (crates/polars-plan/src/traversal/tree_traversal.rs:57, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/traversal/tree_traversal.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"949fae7c67b4b72ab65d1267c543d5693213a21c5967db0037e191bbf51725b9"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/polars-cli\u0060, \u0060crates/polars-plan\u0060, \u0060docs/source\u0060, \u0060docs/source/src/rust\u0060, \u0060py-polars\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060csv_file_info\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae27d757b30de02a4eda7a0a4d2a934c758beb0063c1f90a7d38bad7ca620fc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_check_for_numpy(indices) and isinstance(indices, np.ndarray)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/expr/expr.py, py-polars/src/polars/lazyframe/frame.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":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":3176}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf4f8003ad0ce29bfb5579589028bb8ad4a50a578d7b8f1a395ea57e49ef7a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_check_for_numpy(key) and isinstance(key, np.ndarray)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/_utils/getitem.py, py-polars/src/polars/series/series.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":"py-polars/src/polars/_utils/getitem.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5defe4913f25a7c6d1668c8a48d0ac25c9911a432213eca1460088eb2abe4750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_check_for_numpy(other) and isinstance(other, np.ndarray)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/expr/array.py, py-polars/src/polars/series/series.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":"py-polars/src/polars/expr/array.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"795d41f2ccb578a87845daaddd3dd55fb743085b4c6b3ae70979c16822a62f50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060credential_provider is not None and credential_provider != \u0022auto\u0022\u0060 appears character-identically in 5 files \u2014 py-polars/src/polars/dataframe/frame.py, py-polars/src/polars/io/delta/_sink.py, py-polars/src/polars/io/delta/functions.py, py-polars/src/polars/io/lance/api.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3334aab42ac34205a54b890decf6ed2bcf51d53d7ebf95b9e6a85e03e6f2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype is not None and dtype != arr.dtype\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/dataframe/frame.py, py-polars/src/polars/series/series.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3ce192013832ffee111b594e7137a41a765edad1575f13b90bd3304adc7697"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing_resolved_version_key is not None and existing_resolved_version_key == version_key\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/io/delta/_dataset.py, py-polars/src/polars/io/lance/_scan_resolver.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":"py-polars/src/polars/io/delta/_dataset.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e870d49e05c0f92beeda9df9b6225d36322405f16fc6fa8835e4b2ce61c3e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(indices, Sequence) and not isinstance(indices, str)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/expr/expr.py, py-polars/src/polars/lazyframe/frame.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":"py-polars/src/polars/expr/expr.py"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5295bf864d529d609ce7c00dafb8f3f9f33045dd3f62103aa7ce136f0422383"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(source, Struct) and isinstance(target, Struct)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/_utils/construction/dataframe.py, py-polars/src/polars/sql/context.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":"py-polars/src/polars/_utils/construction/dataframe.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbfd7a76250b18774d16b59f719961580fe27e04d90973575576888f692dd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not _ALTAIR_AVAILABLE or parse_version(altair.__version__) \u003C (5, 4, 0)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/dataframe/frame.py, py-polars/src/polars/series/series.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"04759e2c82cf1d728178729243b581b368ba8fb40cc7b43798edc7539de7f894"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not _PYARROW_AVAILABLE or parse_version(pa.__version__) \u003C (8, 0)\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/dataframe/frame.py, py-polars/src/polars/series/series.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1611e4d3f758a49c98cf3044e4ba85775228ae19569abc7070483dbd5cdde14c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.storage_options is not None or self.credential_provider_builder is not None\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/io/delta/_dataset.py, py-polars/src/polars/io/lance/_scan_resolver.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":"py-polars/src/polars/io/delta/_dataset.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf98e6251f66b1dc2ee9e2a5860eafd5cc1414141541d5a9a3263477f9f50d92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060storage_options is not None or credential_provider_builder is not None\u0060 appears character-identically in 2 files \u2014 py-polars/src/polars/dataframe/frame.py, py-polars/src/polars/lazyframe/frame.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":"py-polars/src/polars/dataframe/frame.py"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"84df24b7011c3939573ba146302ed2b85d7931e970302006fc1194897d364122"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!chunked_arr.has_nulls() || chunked_arr.null_count() == chunked_arr.len()\u0060 appears character-identically in 2 files \u2014 crates/polars-ops/src/series/ops/interpolation/interpolate.rs, crates/polars-ops/src/series/ops/interpolation/interpolate_by.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-ops/src/series/ops/interpolation/interpolate.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee900d6954dd32f02fd45f536b68dc9d7ad0d3f88461b4b6cc85790f15dcaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dt1.is_primitive_numeric() || !dt2.is_primitive_numeric()\u0060 appears character-identically in 2 files \u2014 crates/polars-expr/src/dispatch/range/linear_space.rs, crates/polars-plan/src/plans/aexpr/function_expr/range.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/dispatch/range/linear_space.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0c53450cfb2382a2e33b2afda87eb6421f483984422915145393150a59f964"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.runtime_filters.is_empty() \u0026\u0026 !self.runtime_filters.is_set() \u0026\u0026 self.left_is_build == self.planned_build_left()\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/equi_join/mod.rs, crates/polars-stream/src/nodes/joins/semi_anti_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d99a7052f6d5168ed0d10e0a56d0bd6b15b2d008fa7dfc9c8c07c082533b53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MARK_MATCHES \u0026\u0026 !self.nulls_marked.load()\u0060 appears character-identically in 2 files \u2014 crates/polars-expr/src/idx_table/binview.rs, crates/polars-expr/src/idx_table/single_key.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/idx_table/binview.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b511b7a687072dae277fcf02dded413589be59665a8d704329de2e7ba8155ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060apply.is_some() || options.is_rolling() || options.is_dynamic()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/plans/stats/node.rs, crates/polars-plan/src/plans/stats/value_range.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/stats/node.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d919e2122d6ad8bedb71cc1a7ba6f9d14743ec440e5b70a4f79c07ca4d311b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype.is_categorical() || dtype.is_enum()\u0060 appears character-identically in 3 files \u2014 crates/polars-io/src/predicates.rs, crates/polars-plan/src/plans/aexpr/function_expr/schema.rs, crates/polars-plan/src/plans/aexpr/predicates/column_expr.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-io/src/predicates.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edfecfd5781620a293d89eee005c78083074838a5a721a279ca16e1b0aced17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype.is_primitive_numeric() || dtype.is_decimal()\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/fmt.rs, crates/polars-sql/src/sql_expr.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/fmt.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f72d14a25704a54096ddda2db3ca827091b3d1c4bf2e96c1db54feb18a075c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype.is_primitive_numeric() || dtype.is_temporal()\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/reduce/approx_n_unique.rs, crates/polars-expr/src/reduce/mean.rs, crates/polars-ops/src/chunked_array/binary/namespace.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/approx_n_unique.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad9be5da607f6cf53b6da02dc769f5d2a46f33f9bd2580bfdbc678e168c52d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype.is_primitive_numeric() || dtype.is_temporal() || dtype.is_decimal() || dtype.is_categorical() || dtype.is_enum()\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/reduce/first_last.rs, crates/polars-expr/src/reduce/first_last_nonnull.rs, crates/polars-expr/src/reduce/implode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/reduce/first_last.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddae37e374de15ab9005591f974c975ecbfbdb58bc0ae8872e63b3de8dfffbf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060elementwise_must_aggregate \u0026\u0026 has_not_agg_with_overlapping_groups\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/expressions/apply.rs, crates/polars-expr/src/expressions/binary.rs, crates/polars-expr/src/expressions/structeval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58d1a7b9dec2caa94825f4c75ec601f46d3af4f1fca181ab3fc11562043991a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr_references_any_column(left) \u0026\u0026 expr_references_any_column(right)\u0060 appears character-identically in 2 files \u2014 crates/polars-sql/src/catalog.rs, crates/polars-sql/src/context.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/catalog.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a516d25e0ee7666fb988849465f707b4963eb0f4645dd57815c88e5d9bb185"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060format == \u0022iso\u0022 || format == \u0022iso:strict\u0022\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/chunked_array/temporal/date.rs, crates/polars-core/src/chunked_array/temporal/time.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/date.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d36be6158b75fc5332ea00e2c1fa13d73ecca07b1bcfd1557e944bff3e8d232"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_agg_list || has_agg_scalar || has_not_agg\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/expressions/apply.rs, crates/polars-expr/src/expressions/binary.rs, crates/polars-expr/src/expressions/structeval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745ada8bfdc863f6ab0b097e9cc229cc6a68f001c11c078db1d87475a1ebd5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_agg_scalar \u0026\u0026 (has_agg_list || has_not_agg)\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/expressions/apply.rs, crates/polars-expr/src/expressions/binary.rs, crates/polars-expr/src/expressions/structeval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e5ae6403e3fa3a3372f4c29d02c3284a61ceb8cf939a7f5d12ad247b147b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_not_agg \u0026\u0026 (has_agg_list || not_agg_groups_may_diverge)\u0060 appears character-identically in 3 files \u2014 crates/polars-expr/src/expressions/apply.rs, crates/polars-expr/src/expressions/binary.rs, crates/polars-expr/src/expressions/structeval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-expr/src/expressions/apply.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"82369d111c944065b7f4be1122cf16eded3fdc2e3aea94d412b6e995ece4684d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060incoming_dtype.is_null() \u0026\u0026 !target_dtype.is_null()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb395328822c6195521425d45144760038fd44ed41fd8c4ef77a8655a59491e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_filter_predicate \u0026\u0026 passes_on_filter_predicate(expr)\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/plans/conversion/stack_opt.rs, crates/polars-plan/src/plans/optimizer/stack_opt.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/conversion/stack_opt.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68e2143358af25a23c99f7c1ec6e12724c4427939a2ca0cb04081842fdc6066"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs.len() == rhs.len() || lhs.len() == 1 || rhs.len() == 1\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/series/comparison.rs, crates/polars-expr/src/expressions/binary.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/series/comparison.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5233fe46d2cabd076808ae60719500ae860dee74dce1031baa736668e06161d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060num_rows_to_skip \u003C chunk.len() || chunk.len() == 0\u0060 appears character-identically in 2 files \u2014 crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs, crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required_masked_dense.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/read/deserialize/dictionary_encoded/required.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b53e47147b2a8923b084aa2352245059a8f092180c5b1d36ea5e4615f6c631a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opt_v.is_some() \u0026\u0026 self.non_null_count \u003E= self.min_samples\u0060 appears character-identically in 2 files \u2014 crates/polars-compute/src/ewm/mean.rs, crates/polars-compute/src/ewm/sum.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/ewm/mean.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"77815fac3dd9d84e23fab026434b2ba175b5dd9ebea2d5be68425909f6466893"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.is_optional() \u0026\u0026 array.validity().is_some()\u0060 appears character-identically in 3 files \u2014 crates/polars-parquet/src/arrow/write/binary/basic.rs, crates/polars-parquet/src/arrow/write/binview/basic.rs, crates/polars-parquet/src/arrow/write/fixed_size_binary/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-parquet/src/arrow/write/binary/basic.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3990b14fe761b435df67baeee9a896b6b45b0b3500b21f32a14b3d2923ae9dba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.is_strict() \u0026\u0026 self.null_count() != ret.null_count()\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/chunked_array/cast.rs, crates/polars-core/src/chunked_array/logical/categorical.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/cast.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ab4cc67862d785222ca78c5cfde17c2505db3590ad6b514bf64b2f2d4c400c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv[0] == PortState::Done \u0026\u0026 recv[1] == PortState::Done\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/in_memory.rs, crates/polars-stream/src/nodes/repeat.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/in_memory.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb8573675f12b0243797650cb267c71facd3e3d27e0a49cb89aa773c6973529"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv[0] == PortState::Done || left_saturated\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/equi_join/mod.rs, crates/polars-stream/src/nodes/joins/semi_anti_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc57c5fc7df05dd98e251652fe52c96b32fc2d5ae3c890fcda4776fd2b64994c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv[1] == PortState::Done || right_saturated\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/equi_join/mod.rs, crates/polars-stream/src/nodes/joins/semi_anti_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c280ac4e0f08d906c7871514dd74ab953cb6de600552a5ac0ba971afe1bba0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv_ports.is_empty() \u0026\u0026 send_ports.len() == 1\u0060 appears character-identically in 4 files \u2014 crates/polars-stream/src/nodes/in_memory_source.rs, crates/polars-stream/src/nodes/input_independent_select.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/mod.rs, crates/polars-stream/src/nodes/spill_frame_source.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/in_memory_source.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a7a5607fdaffb70190cad34b8deadba455d4d8fa527cd03ac57dc22851e6e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv_ports.len() == 1 \u0026\u0026 send_ports.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/callback_sink.rs, crates/polars-stream/src/nodes/in_memory_sink.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/callback_sink.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5f65a99b5e47638a6193f2073b939bbf098ee186585674f6e742cb498e4b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv_ports.len() == 1 \u0026\u0026 send_ports.len() == 1\u0060 appears character-identically in 19 files \u2014 crates/polars-stream/src/nodes/dynamic_group_by.rs, crates/polars-stream/src/nodes/filter.rs, crates/polars-stream/src/nodes/forward_fill.rs, crates/polars-stream/src/nodes/gather_every.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/dynamic_group_by.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a97cf62ae9b441c304a940d00ae338f1175d07f1d088a1e1f1a7980dafd0e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv_ports.len() == 2 \u0026\u0026 send_ports.len() == 1\u0060 appears character-identically in 7 files \u2014 crates/polars-stream/src/nodes/gather.rs, crates/polars-stream/src/nodes/joins/asof_join.rs, crates/polars-stream/src/nodes/joins/cross_join.rs, crates/polars-stream/src/nodes/joins/merge_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/gather.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7184c01bf0d723e706b48eebe1cbd718396ee04a308ecf7191f8f3b1838eb63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime_filters.is_empty() || args.build_side.is_some()\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/equi_join/mod.rs, crates/polars-stream/src/nodes/joins/semi_anti_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a77043ed0380a7cefa9b5ac033d5410caecb30af4430870e0bccfe836538640"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sample_state.only_side.is_none() \u0026\u0026 recv[1 - idx] == PortState::Done\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/joins/equi_join/mod.rs, crates/polars-stream/src/nodes/joins/semi_anti_join.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/joins/equi_join/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c130ea2d96610409e208ca9f941d89e8cfc9966110cd2eb9d8a3d07054a0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scan_source.is_cloud_url() || polars_config::config().force_async()\u0060 appears character-identically in 6 files \u2014 crates/polars-stream/src/nodes/io_sources/csv/builder.rs, crates/polars-stream/src/nodes/io_sources/ipc/builder.rs, crates/polars-stream/src/nodes/io_sources/lines.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/functions/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/csv/builder.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"494f174056a0d3eaeba4d69356e2a29b7cb79d1c5701122354e46f733f0ce79f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.name == other.name \u0026\u0026 self.metadata == other.metadata\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/datatypes/extension/generic.rs, crates/polars-python/src/extension.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/datatypes/extension/generic.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3434d65499d46ea08494354960cd2666a63e3b2d10c6199c702793c00999cc08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.null_count() \u003E 0 \u0026\u0026 !options.nulls_last\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/chunked_array/ops/sort/categorical.rs, crates/polars-core/src/chunked_array/ops/sort/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/categorical.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4bdabc848801c96e1c53785c2c4cd15a16fb8959b8885975643748ecbee09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.null_count() \u003E 0 \u0026\u0026 options.nulls_last\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/chunked_array/ops/sort/categorical.rs, crates/polars-core/src/chunked_array/ops/sort/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/ops/sort/categorical.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1373d2b0c9cfc18c60c20a485548fee9fb018d0317c3d5098e48614829148d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.row_index.is_some() || self.pre_slice.is_some()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/pipeline/models.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8f072f02b7d38d61c564d4c84141aa9b33385b5e8f62b0f16bb65124ee86dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060send[0] == PortState::Done \u0026\u0026 !matches!(self, Self::Done)\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/columnar_function.rs, crates/polars-stream/src/nodes/in_memory_map.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/columnar_function.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6ffcb2137fa43b155adcee78ea0dbc81f759e498d3238787bc0f13da0abd1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060send_ports.len() == 1 \u0026\u0026 recv_ports.len() == 1\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/is_sorted.rs, crates/polars-stream/src/nodes/reduce.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/is_sorted.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ddd96191dab426b98bd0e945dd544bf9106150d13db0533afa2488c338d260"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source_token.stop_requested() || inner.failed\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/sort/flush.rs, crates/polars-stream/src/nodes/window/flush.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/sort/flush.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a67d2a85784547b5e478756fa31a74e3566709b9c01d2a88c4c677e3c7c43fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source_token.stop_requested() || self.failed.load(Ordering::Relaxed)\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/group_by/flush.rs, crates/polars-stream/src/nodes/joins/equi_join/flush.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/group_by/flush.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1269310b2c106473c1c68e36d47d11b6c08be61c4f427a517678f6f0910f34d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sources.is_cloud_url() || (sources.is_paths() \u0026\u0026 polars_config::config().force_async())\u0060 appears character-identically in 2 files \u2014 crates/polars-mem-engine/src/function_ir/count.rs, crates/polars-plan/src/plans/conversion/dsl_to_ir/scans.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-mem-engine/src/function_ir/count.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc6a6c25c7dc61e402eb2293564a2c5a44ba5d596fa29024623f058fbc56e5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003C= slice.len() \u0026\u0026 end \u003C= slice.len() \u0026\u0026 start \u003C= end\u0060 appears character-identically in 7 files \u2014 crates/polars-compute/src/rolling/arg_min_max.rs, crates/polars-compute/src/rolling/min_max.rs, crates/polars-compute/src/rolling/moment.rs, crates/polars-compute/src/rolling/no_nulls/rank.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/rolling/arg_min_max.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdada470ab2d7f89671bd826ebc674911acdcae316c067a8693efcd809fbb286"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strict \u0026\u0026 ca.null_count() != out.null_count()\u0060 appears character-identically in 2 files \u2014 crates/polars-core/src/chunked_array/temporal/string/infer.rs, crates/polars-ops/src/chunked_array/strings/namespace.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-core/src/chunked_array/temporal/string/infer.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb2a3ee5ce94bfe36f76af245b1effa99e7cf5e275c3162d50dd41ba3c6ec2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_dtype.is_float() \u0026\u0026 incoming_dtype.is_float()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0084943f5a92f1b23db0b1117ae44e5cf6315c2a07cfaaf704673af42ccc0333"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_dtype.is_float() \u0026\u0026 incoming_dtype.is_integer()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"336e52165e2f1e2807bf8f06d33c445247949d1eea08dc7d3b74d124f7e9e348"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_dtype.is_integer() \u0026\u0026 incoming_dtype.is_integer()\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e095bf36f01b27e6e46e70abe32c9c767b44579712776ac0e9c54c47d8205185"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_scale != incoming_scale || target_precision \u003C incoming_precision\u0060 appears character-identically in 2 files \u2014 crates/polars-plan/src/dsl/file_scan/mod.rs, crates/polars-stream/src/nodes/io_sources/multi_scan/components/column_selector/builder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/dsl/file_scan/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a1371ad7a9d2d31a65e1afb822784e799a773195db200ae75156d600d971c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060values.null_count() == values.len() || indices.null_count() == indices.len()\u0060 appears character-identically in 3 files \u2014 crates/polars-compute/src/gather/fixed_size_list.rs, crates/polars-compute/src/gather/list.rs, crates/polars-compute/src/gather/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-compute/src/gather/fixed_size_list.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9f5c993b25f3a4439f797a4e2df3104611540f1dd85834da346e446a0fafc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060verbose \u0026\u0026 !matches!(byte_source, DynByteSource::Buffer(_))\u0060 appears character-identically in 2 files \u2014 crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs, crates/polars-stream/src/nodes/io_sources/parquet/metadata_utils.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-stream/src/nodes/io_sources/ipc/metadata.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"899199f0e61394ae40a380fbdf98879b0fd09de822c6a26bc13239c316fedad8"}},{"ruleId":"X21","level":"warning","message":{"text":"Pattern guard mutates state while matching: The \u0060if\u0060 guard on line 374 (\u0060(Scan { sources, file_info, hive_parts, output_schema, mut unified_scan_args, predicate, predicate_file_skip_applied, scan_type, maintain_order, }, Some(state),) if predicate.is_none() \u0026\u0026 match \u0026*scan_type { [cfg(feature = \u0022       \u0022)] FileScanIR::Parquet { .. } =\u003E true, [cfg(feature = \u0022   \u0022)] FileScanIR::Ipc { .. } =\u003E true, [cfg(feature = \u0022   \u0022)] FileScanIR::Csv { .. } =\u003E true, [cfg(feature = \u0022    \u0022)] FileScanIR::NDJson { .. } =\u003E true, [cfg(feature = \u0022      \u0022)] FileScanIR::PythonDataset { .. } =\u003E true, [cfg(feature = \u0022          \u0022)] FileScanIR::Lines { .. } =\u003E true, FileScanIR::ExpandedPaths { .. } =\u003E false, FileScanIR::ExternalReaderBuilder { .. } =\u003E true, FileScanIR::Anonymous { .. } =\u003E state.offset == 0, } =\u003E\u0060) changes \u0060feature\u0060 with \u0060feature = \u2026\u0060 while the \u0060match\u0060 is deciding whether that arm applies. Rust tests a guard during PATTERN MATCHING \u2014 after the arm\u0027s pattern has matched and before the arm is chosen, going on to the next arm when it is false \u2014 so the change lands whenever this arm is merely TESTED, whether or not it is then chosen, and never once an earlier arm has matched. And \u0060\u0026\u0026\u0060 can skip it, so it does not happen at all whenever what decides first already answers the guard. The accounting therefore depends on evaluation order and on how many arms the subject was tested against, not on any statement a reader can point at: a counter kept this way misses exactly the path the deciding operand rules out, so it cannot reach a limit it is checked against on that path. Move the change out of the guard \u2014 leave it reading only (\u0060if feature \u002B 1 \u003E= limit\u0060) and put the assignment in the arm\u0027s BODY, where it runs precisely when the arm is chosen, or hoist it above the \u0060match\u0060 if it must happen for every subject."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-plan/src/plans/optimizer/slice_pushdown_lp.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f98ad64c4011c8bf7743fd68a7472ae8a1ab7f6fc6cc34209313cf68df32b6"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-polars/debug/launch.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f76ff499bff60d9e29b6f38b8c5a21c8817dac60bb2434986f872daf3cf77c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060catalog_tables\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/polars-sql/src/context.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"663d3d8370f2efb6a2caab65e665356426c14beaa50d0a647b9579e71a5f9499"}}],"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-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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-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-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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":187,"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."]}]}